System and method for time correlated multi-photon counting measurements

ABSTRACT

The invention provides a method and a measurement system for characterization of luminescence properties, the method comprises irradiating the luminescent material with a pulse of excitation light, providing a triggering signal correlated to the pulse of excitation light; detecting with a photodetector such as a photomultiplier tube (PMT) a plurality of photons emitted from the luminescent material as result of the pulse of excitation light, the photodetector providing an output signal upon the event of detection of a photon; determining for each detected photon a photon arrival time and providing an output suitable for inputting to an analysing module wherein an output comprises zero, one, or more photon arrival time for each excitation, receiving said outputs in an analysing module; and determining in the analysing module, characteristics properties of the luminescent material by performing a statistical analysis based on Bayesian inference.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a filing under 35 U.S.C. §371 and claims priority to international patent application number PCT/GB02/05543 filed Dec. 6, 2002, published on Jun. 19, 2003 as WO 03/050518 and also claims priority to patent application number 0129589.8 filed in Great Britain on Dec. 11, 2001; the disclosures of which are incorporated herein by reference in their entireties.

The present invention relates to a method and system for measuring luminescence lifetime. More particularly, the invention relates to a method and apparatus that significantly reduces the measurement time in a Time Correlated Multi-Photon Counting (TCMPC)-measurement.

BACKGROUND OF THE INVENTION

Measurement of the luminescence emission of substances has become increasingly important as a sensitive analytical technique in a wide range of disciplines such as chemistry, biology, engineering, materials science and application areas ranging from pollution monitoring and production control in a chemical plant to the sequencing of DNA. In many of these areas, distinguishing the weak but characteristic emission of the substance of interest from background light is difficult. Measuring the lifetime of the light emission of the substance of interest can often be used to discriminate the desired signal from a background. In this context we define the luminescence lifetime of a substance to be the time taken for the intensity of light emitted in response to an exciting pulse of light to fall to 1/e (˜1/2.7) of its initial value. This characteristic time can range from less than one nanosecond to minutes, depending on the processes involved. Such processes can be described as fluorescence, luminescence or phosphorescence, but if the desired light emission has a lifetime which is different from light of another source, its detection can be enhanced.

One example of fluorescence measurements is in DNA sequencing, where molecular fragments are ‘labelled’ with a fluorescent dye and the fluorescence emission of a dye-labelled fragment is used to identify which amino acid base begins or ends a given sequence of amino acids. Another application is in the screening of potential drugs against a target molecule. Typically changes in fluorescence intensity are used to identify ‘hits’ in response to a chemical test or ‘assay’ of the interaction between a potential drug and a target molecule. In this case, either the drug or the target or both may be labelled. In both sequencing and screening, the characteristic lifetime of a fluorescent molecule can be used to improve its detection.

A fluorescent material is a material which can be excited to a higher electronic state and on relaxing towards its ground state emits a photon. The time elapsed from the excitation until the emission of a photon, the intensity of emitted photons, and the energy (frequency) of the photons are all properties that can be measured and used to characterize the material. The excited state is typically achieved by subjecting the material to a short light pulse. The emission of photons is a Poisson process and the intensity of the emitted photons is continuously decreasing, and typically follows an exponential decay. A useful way of characterising a fluorescent material is to measure the time elapsed between an excitation and the arrival of photons at a detector. λ(t) denotes the Poisson arrival rate at time t at all times and is given by: λ(t)=Ae ^(−αt)  equation 1 where A denotes the intensity of a single fluorescent material, measured in photons per second, at time 0 (the time of the excitation), also referred to as the initial intensity, α denotes the decay constant of the fluorescence, measured in nepers/second, and 1/α is the fluorescence lifetime, which is often used to characterise a fluorescent material. If a sample has more than one fluorescent material present, the arrival rate of photons can typically be described by a multiexponential expression.

A widely used technique of determining the fluorescence lifetime of a material is Time Correlated Single Photon Counting (TCSPC). In TCSPC a sample is typically subjected to a short light pulse, which excites the material in the sample. The material will, if fluorescent, emit a photon a short time after the excitation. The emitted photon is detected and the time that has elapsed between the excitation light pulse and the arrival of the first emitted fluorescence photon is recorded by the measurement system. The technique is only capable of counting a maximum of one photon per excitation. In practice less than one photon per excitation are counted since, to get a representative distribution of arrival times, a low intensity of the exciting light pulse is used, giving a low probability of photon emission. Therefore, to get a reliable measure of the fluorescence lifetime characteristic of a particular material, using TCSPC, i.e. to acquire a fluorescence decay curve, the process of exciting the material in the sample and detecting the first emitted photon, has to be repeated a large number of times. A measurement can typically involve several tens of thousands excitation-photon detection cycles. The TCSPC method has been continuously improved, for example U.S. Pat. No. 5,990,484 teaches a method and apparatus for counting a total number of emitted photons, allowing a higher intensity of the exciting light pulse, and U.S. Pat. No. 4,686,371 teaches a method of compensating for variations in the length and intensity of the exciting light pulse.

As above indicated, TCSPC can, even if the mentioned improvements are utilised, be a time consuming measurement. It is realised in the art that the method is wasteful in that only the first emitted photon is detected and used for the determination of the fluorescence lifetime, even though the subsequently emitted photons carry information useful for the determination of the characteristic lifetime. A number of approaches have been suggested to extend the TCSPC to also detect and record subsequent photons. The most recent development of the TCSPC-technique includes various multiplexing techniques, in which, in principle, a plurality of detectors are connected to one or more analysing means, examples described in Multiplexed single-photon counting by Scubling et al., Rev. Sci. Instrum. 67 (6), 2238-2246 June 1996. Alternatively multi-element detectors have been suggested, for example by Browne et al. in A 100 ns anti-coincidence circuit for multi-channel counting systems, Meas. Sci. Technol. 6 (6), 1487-1491, June 1996. The suggested Multiplexed Time Correlated Single-Photon Counting (M-TCSPC)—techniques represent significant improvements over the TCSPC—techniques, but have the drawback that the number of photons that it is possible to detect following one excitation pulse is limited by the number of detectors (or detector elements) used; therefore a large number of excitation cycles is still needed to determine the fluorescence lifetime of the material. In addition multielement detectors are costly, as are systems providing a large number of single detectors in a multiplexing arrangement.

The known apparatus and measurement techniques thus suffer, as above described, from a number of disadvantages and limitations, the most important being the long measurement time. Thus, there is a need in the art to provide a measurement system and method that shortens measurement time.

SUMMARY OF THE INVENTION

The object of the present invention is to provide a system and a method that significantly reduces the measurement time in a major part of the applications. The inventive system is defined in claim 10 and the method and corresponding software module in claims 1 and 9, respectively.

One advantage afforded by the present invention is to be able to use a limited dataset by using a Bayesian algorithm to make better use of the available data.

Yet another advantage of the invention is to be able to take into account the PMT dead time in the lifetime analysis or any other instrumental parameters, such as e.g. non-delta illumination, etc.

Yet another advantage of the invention is the possibility, as a result of a measurement, of giving the posterior probability distribution of a fluorescence lifetime and/or intensity in contrast to the prior art, which typically only gives a single value as a measure of the lifetime and/or intensity.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will now be described in detail with reference to the drawing figures, in which

FIG. 1 is a schematic illustration of a single channel TCMPC system according to the invention;

FIG. 2 is a schematic illustration of a multiple channel TCMPC system according to a preferred embodiment of the invention;

FIG. 3 shows a flowcharts of the measurement and analysing method according to the invention;

FIG. 4 a is a graph showing an example of a trace from the photon timing unit;

FIG. 4 b is a graph showing an example of a trace from the photon timing unit from the multi-channel TCMPC system;

FIG. 5 is a graph showing an example of three prior distributions entered by a user;

FIG. 6 is a graph showing an exemplary output from algorithms A3-A8.

DETAILED DESCRIPTION OF THE INVENTION

The inventive measurement system provided by the present invention will be described with reference to the schematic illustrations of FIG. 1-2. FIG. 1 shows a single channel TCMPC system according to the invention. Fluorescent material is contained in a sample 110. An excitation light source 120 for repeatedly irradiating the sample with pulses of excitation light is provided. The light source preferably a pulsed laser. A light source driving and controlling unit 130 comprises the laser power supply and is arranged to generate a triggering signal 140 to a photon timing unit 150. The repetition rate of the excitation light should be sufficiently low to allow a total decay of the fluorescence of the sample before the next exciting pulse. A pulsing frequency of for example around 200 kHz would commonly be appropriate. The duration of the pulse of excitation light should be significantly shorter than the fluorescence lifetime of the fluorophore in order to obtain reliable lifetime measurements. A typical fluorophore has a fluorescence lifetime in the range of 1-100 ns and a suitable length of the light pulse would be in the order of 0.5 ns. The frequency of the pulse is an example of a parameters typically adjusted for the sample under investigation (the length of the light pulse is an intrinsic characteristic of the laser and typically cannot be easily changed). In addition, the light source 120 and the light source driving and controlling unit 130, should preferably have the facility to adjust other parameters such as the number of pulses and the intensity of the excitation light in order to account for e.g. the amount of fluorophore in the sample, the needed accuracy in the result etc. Light sources, e.g. pulsed lasers, with the characteristics described above and with driving and controlling units therefore are known in the art and commercially available; for example, the NanoLED-07 picosecond laser source from IBH.

Positioned adjacent to a sample chamber containing the sample 110 is a photodetector 160, which has the purpose of detecting the emitted fluorescent photons. Different optical components are placed between the sample and the detector. For example several lenses are used to maximise the amount of fluorescent light collected from the sample and to focus the light onto the detector. Furthermore dichroic mirrors and filters are used to select a range of wavelength and prevent the excitation light from reaching the detector and only let the light having a range of wavelength corresponding to the fluorescence spectrum of the fluorophore reach the detector. An optical component is also used to split the beam of the fluorescent light into several beams that are then directed to the different detectors. This splitting can be achieved in different ways, e.g. by using a beam splitter cube or by using multi-branch fibre optics. These are well known in the art and are commercially available (for example, from Oriel Instrument, 150 Long Beach Boulevard, Stratford, Conn., USA or from Melles Griot, St Thomas Place, Ely, Cambridgeshire, England). The photodetector preferably comprises a photon counting photomultiplier tube (PMT) but other detectors such as an avalanche photodiode can be used. The signal from the photodetector is typically amplified in a pre-amplifier 170. After amplification, the signal can go through a discriminator unit that remove the unwanted noise from the signal and only leave the electrical pulses generated by the photons on the PMT. The discriminator unit is then connected to the photon timing unit 150. The photon timing unit comprises for example a very fast analogue-to-digital converter (A/D converter) and a memory for storing datapoints. As discussed above, it should be possible for more than one photon per excitation, resulting from the excitation light pulse, to be recorded by the photodetector 160 and the photon timing unit 150, not only the first emitted photon as in the TCSPC based techniques. This put certain requirements on the photodetector 160 and the photon timing unit 150; A photon detected by the PMT will give rise to an output pulse that has a duration of c.a. 4-6 ns with the current technology. To identify a PMT pulse position in time at least 4-8 data points per pulse are needed, in accordance with the method described further below. In order to detect a plurality of such pulses the A/D converter needs to have a sampling frequency at least of around 2 GS/s and the ability to store data points corresponding to an acquisition period of approximately 100 ns. A/D converters with such extreme capabilities have only recently been made commercially available. An example of a suitable A/D converter is the Acquiris DP210 (2 GS/s) from Acquiris Europe, 18 chemin des Aulx, 1228 Plan-les-Ouates, Geneva, Switzerland. The collected data points are analysed by an arrival time determination module 155, preferably realised as a software program module residing either within the photon timing unit 150, or alternatively within an external computer 180, to determine the arrival time of the fluorescence photons. Examples of suitable algorithms for arrival time determination will be given below. Arranged to receive and analyse a dataset of photon arrival times from the arrival time determination module, is an analysing module 185, which preferably is a software program package implemented in and executed on the computer 180. The computer can be a general purpose computer such as a PC or a workstation or a special purpose machine. The computer 180 is preferably also used for controlling the measurements, monitoring the equipment etc. and therefore is equipped with communication means (not shown) connected to other units of the measurement system. Installed in and executing on the computer, is then also a software program module for measurement control 190. As appreciated by the skilled in the art, the installation of and execution of the software modules 155, 185 and 190 can be done in various ways and in various computer configurations. For example the measurement control unit 190 can be executed in a PC suitable for laboratory conditions, the arrival time determination module 155 can be incorporated within the photon timing unit, and the analysing module 185 in a special purpose machine designed for the high computational speed needed for certain analysis. The inventive methods utilised by the analysing module 185 will be described in detail below.

Photodetectors such as PMTs give a signal that typically last 4-5 ns. During that time the PMT is incapable of detecting any new photons. This is often referred to as PMT dead time. If photons arrive during the PMT dead time, i.e. less than 5 ns apart, the measurement system will not be able to record them. As will be described further below, the analysing method can be made to take into account the PMT dead time, but the fact that the system is incapable of recording photons during certain time intervals will prolong the needed measurement time.

In one embodiment of the present invention the measurement system has been provided with a plurality of photodetectors (PMT) and amplifiers connected to them, giving a multi-channel TCMPC. In FIG. 2 this is exemplified with a dual-channel system, having a first PMT 200, and a second PMT 205, connected to preamplifiers 210 and 215, respectively. The preamplifiers are connected to a common photon timing unit 150 with independent channels. Alternatively a plurality of photon timing units can be used. If one of the PMT is recovering after detecting a photon, the other may still be capable of detecting a subsequent photon. The effective dead time of the system is thus reduced. More than two PMT—amplifier channels can be used to further reduce the effective PMT dead time.

An experimental procedure using the inventive methods and measurement system according to the invention will be described with references to the flowchart of FIG. 3. Variations of the experimental procedure are possible and the procedure now described should be considered as one of many embodiments possible. The aim of the measurement is typically to determine the initial intensity of fluorescence, the fluorescence lifetime (1/α) or the posterior probability distribution of the intensity or lifetime of one or a plurality of fluorophores contained in the sample 110.

The experimental procedure comprises:

-   -   300: In a first step 300, the user enters, to the measurement         controlling module 190 and the analysing module 185, a number of         parameters used for controlling the measurement, choosing an         appropriate analysis algorithm depending primarily on prior         knowledge of the sample, and parameters describing the         performance of the equipment such as PMT dead time. Parameters         important for the inventive methods described below comprise:         -   N—the number of excitations (laser pulses);         -   α_(i)—the reciprocal of the fluorescence lifetimes (if             known) and/or the prior distribution of lifetimes, P(α_(i));         -   A_(i)—the fluorescence initial intensities (if known) and/or             the prior distribution of intensities, P(A_(i));         -   δ—the PMT dead time;         -   τ—the time the detector is blocked after an excitation;         -   υ—the duration of recording after each excitation         -   A1, A2, A3, A4, A5, A6, A7, A8—Analysis algorithms         -   Many of the parameters are not changed for each measurement             and default values are preferably stored in a database.     -   305: The measurement starts by illuminating the sample 110 with         a pulsed laser 120.     -   310: In a next step, 310, the emitted photons are collected by         PMT tube(s) 160 and the signal is amplified by a pre-amplifier         170 and possibly the signal is discriminated to remove unwanted         noise.     -   315: In step 315, the arrival time of the emitted photons are         determined by the photon timing unit 150 and the arrival time         determination module 155, with one of the methods that will be         described below. The arrival time determination module 155         outputs for each excitation n a dataset D_(n), comprising the         photon arrival times, to the analyzing module 185.     -   320: In step 320, if the predetermined number of excitations N         is reached the procedure goes to step 325, if not, steps 300-320         are repeated.     -   325: In step 325, the datasels D_(n) are analysed with one (or         more) of the algorithms A1-A8, the algorithms being based on         Bayesian inference.     -   330: In a final step 330, the result is presented to the user.         Depending on the algorithm chosen and the preferences of the         user the output can be distributions of the fluorophore         lifetimes or initial intensities, joint distributions, a measure         of a fluorophore lifetime etc.

Alternatively the measurement procedure can stop then a predefined accuracy is achieved. In this case the analysis using Bayesian inference (step 325) is performed within the main loop of the algorithm. If, for example, the measure of a fluorescence lifetime has the predefined accuracy, the loop is halted. The procedure can of course in addition have a limit to the number of pulses used, which terminates the measurement even if the specified accuracy has not been met.

Arrival Time Determination

The method of determining photon arrival times performed in the arrival time determination module 155, will be described with reference to FIG. 4 a-b. FIG. 4 a gives an example of an output, commonly known as a trace, from the photon timing unit 150. The initial broad peak in the top curve corresponds to the triggering signal 140 sent from the light source driving and controlling unit 130 to the photon timing unit 150, when the excitation light source 110 irradiates the sample. It should be noted that this triggering signal itself is much longer (in this case it lasts for about 50 ns) than the actual laser pulse (that last for only 0.5 ns). Only the rising part of the signal is used by the photon timing unit 150 to determine the trigger to start the time base. The rest of the triggering signal is ignored by the photon timing unit. It must be noted that the length of the triggering signal does not correspond to the length of the laser pulse. If the laser pulse is longer than the resolution of the photon timing unit, one can block the photodetector during a time τ. An emitted fluorescence photon is detected by the PMT and give rise to the pulse from the PMT, amplified in the pre-amplifier (solid line on FIG. 3), discriminated to remove the noise (dotted line on FIG. 3) and digitised in the A/D-converter, to show as the peak 210. It should be noted that the discriminator introduces a delay in the signal, explaining the shift between the position of the pulse in the solid and dotted line. This is not a problem, as this time delay is constant, it can be subtracted subsequently by the timing unit The time elapsed between the triggering signal and the appearance of the first peak 210 is the arrival time of the first fluorescence photon. The second peak 220 corresponds to a subsequent fluorescence photon.

A method of determining the arrival time of the fluorescence photons will now be described with references to FIG. 4 a-b. The trace is a list of data points, each point representing an output voltage from the PMT at a given time. In the embodiment with a plurality of photodetectors a corresponding plurality of parallel traces will result. In a first step 505 a zero time is defined as the beginning of the triggering pulse (for example, at the time when the trigger pulse reaches 50% of its maximum amplitude). The second step 510 is discrimination by selecting a part of the trace that is larger than a threshold value (this can be done by software or by hardware in the discriminator). In the following step 515 a local maximum of the voltage is defined as a point that is larger than both the point directly preceding it and the point directly following it. The time corresponding to the local maximum is recorded in step 520. This is defined as the arrival time of the photon. The method is preferably realised by a software program executed either in the photon timing unit 150 or in an external computer 180. The result is a dataset D_(n) of measured arrival times for each excitation pulse n. As appreciated by the skilled in the art other methods of finding arrival times in a trace of datapoints can be utilised. For example, a first point larger than a preset threshold, or the point with the largest slope (largest derivative) in the peak, can be used to define an arrival time. The method chosen is typically a trade-off of the required precision in the definition of the arrival time and the computational time needed to determine the arrival time.

FIG. 4 b shows the two traces, and the trigger signal from the laser pulse, resulting from the measurement system of FIG. 2. Both the multi-channel and the single-channel TCMPC can further be provided with discriminators, one for each channel, or other noise reduction means.

It should be noted that with all these methods, there is sometime an artefact. The algorithm may identify two points (or more) in a single pulse that satisfy the selection criteria. In order to remove the artefactual points, a subroutine would check whether several selected points are spaced with a time less than the PMT dead time and only select the first point in the group.

Bayesian Inference

The method of the present invention, which will be illustrated by the embodiments, algorithms A1-A8, are based on the principle of Bayesian inference. Bayesian inference offers a way of determining the (posterior) probability distribution of a variable (or vector of variables) in the light of some data taking into account prior knowledge of the probability of the variable taking various values. As an example, let us suppose that θ represents what we want to know. Usually θ will be a vector of many numbers; it might for example be the vector of intensities of a number of fluorophores. Let us suppose that D represents what we do know. D might for example the arrival times of some photons. Now, we know that for any specific value of θ, which specifies the vector of intensities, that some values of D are more likely and others less likely, and because we know the manner in which the data arises from θ, we can say exactly how much more or less likely. In other words, we can evaluate, for any specific values of θ and D, the value of P(D|θ), the probability of D given θ. We also know, before we even receive D, that some values of θ are more likely than others. For the photon counting example negative intensities can be excluded, as can values of the intensities that are extremely large (e.g. >1 e15 per second) or too small. This can all be precisely specified as a prior distribution on θ, denoted P(θ).

What we actually want to know is the value of θ, given some specific value of D. This is given by Bayes' theorem:

$\begin{matrix} {{P\left( \theta \middle| D \right)} = \frac{{P(\theta)}{P\left( D \middle| \theta \right)}}{\int{{P(\theta)}{P\left( D \middle| \theta \right)}{\mathbb{d}\theta}}}} & {{equation}\mspace{14mu} 2} \end{matrix}$ which tells us that given that particular value of D, how likely each value of θ is. In eq. 2 P(θ) is referred to as the Prior, P(D|θ) as the Likelihood, P(θ|D) as the Posterior, and ∫P(θ)P(D|θ)dθ as the Evidence (for the model).

A posterior distribution derived by Bayesian inference may by used in different ways: View the entire posterior distribution—possible in some cases (dimensionality not more than 2) and impossible in others; MAP (maximum a posteriori)—find the value of θ where the posterior probability density is greatest (if possible); and report just that value of θ, Mean posterior value—report the mean posterior value of θ, θθP(θ|D)dθ; Random samples—drawing random samples from the distribution P(θ|D). The method of random samples is often the preferred way of using the Posterior. Random samples can be independent or non-independent.

The Bayesian principles are utilized in the inventive method of the present invention for substantially shortening the measurement time needed for e.g. determination of a fluorescence lifetime. The reduction in measurement times arises from the fact that by using Bayesian inference adapted to the application of TCMPC fewer photons are needed to characterize a fluorophore compared to the prior art methods. The method fully utilizes the advantage afforded by the inventive system of detecting a plurality of photons for each excitation pulse. Depending on the prerequisite of the measurement, e.g. the number of different fluorophores present in the sample, different embodiments of the method will be appropriate, corresponding to the mentioned algorithms A1-A8. The algorithms are preferably comprised in the analysing module 185, as software programs implemented in and executed on the computer 180 (although it would be possible to embody them in other ways). In the measurement procedure outlined with references to FIG. 3, the programs based on the algorithms are addressed in the initialisation step 300 and the analysis step 325. A brief theoretical background will be given to each algorithm and the algorithms will be presented as pseudo-code with references to accompanying flowcharts.

Algorithm A1, Unknown Fluorophore Lifetimes, Single Fluorophore, No Deadtimes.

The decay rate of a single fluorophore is given by equation 1. To use Bayesian inference, we must have a prior distribution on the unknowns. We will use Gamma distributions on both A and α, as this is both sufficiently expressive and results in relatively simple mathematics. The Gamma distribution has two parameters, m, the shape parameter, and r, the scale parameter, both of which must be positive. Its probability density is given by

$\begin{matrix} {{\Gamma_{m,r}(x)} = {{\frac{r^{m}x^{m - 1}{\mathbb{e}}^{- {rx}}}{\Gamma(m)}{or}\mspace{14mu}{for}\mspace{14mu}\log\mspace{14mu}{x:{\Gamma_{m,r}\left( {\log(x)} \right)}}} = \frac{r^{m}x^{m}{\mathbb{e}}^{- {rx}}}{\Gamma(m)}}} & {{Equation}\mspace{14mu} 3} \end{matrix}$

Varying r scales the whole distribution; varying m changes the shape of the distribution, allowing very broad distributions when m is small and very narrow ones when m is big. We can therefore choose appropriate parameters, and set

$\begin{matrix} {{{P(A)} = \frac{r_{A}^{m_{A}}A^{m_{A} - 1}{\mathbb{e}}^{{- r_{A}}A}}{\Gamma\left( m_{A} \right)}}{and}} & {{Equation}\mspace{14mu} 4} \\ {{P(\alpha)} = {\frac{r_{\alpha}^{m_{\alpha}}\alpha^{m_{\alpha} - 1}{\mathbb{e}}^{{- r_{\alpha}}\alpha}}{\Gamma\left( m_{\alpha} \right)}.}} & {{Equation}\mspace{14mu} 5} \end{matrix}$

As well as a prior, we must be able to calculate the likelihood of the observed data. Let us suppose that during a excitation n, photons arrive at times t_(n,1),t_(n,2), . . . , t_(n,K) _(n) , and at no other times. Then we have the likelihood on the data D_(n) from excitation n given by

$\begin{matrix} {{{P\left( {\left. D_{n} \middle| A \right.,\alpha} \right)} = {\left( {\prod\limits_{k = 1}^{K_{n}}\;\left( {A\;{\mathbb{e}}^{{- \alpha}\; t_{n,k}}} \right)} \right){P\left( {\left. {{no}\mspace{14mu}{other}\mspace{14mu}{photons}} \middle| A \right.,\alpha} \right)}}},} & {{Equation}\mspace{14mu} 6} \end{matrix}$ since in a Poisson process all events occur independently of each other. In a Poisson process of constant rate λ, the probability of no photons occurring in the interval from t₁, to t₂ is e^(−λ(t) ² ^(−t) ¹ ⁾. Where the rate is not constant, this probability is

$\begin{matrix} \begin{matrix} {{P\left( {\left. D_{n} \middle| A \right.,\alpha} \right)} = {\left( {\prod\limits_{k = 1}^{K_{n}}\;\left( {A\;{\mathbb{e}}^{{- \alpha}\; t_{n,k}}} \right)} \right){\mathbb{e}}^{- {\int_{0}^{\infty}{{\lambda{(t)}}{\mathbb{d}t}}}}}} \\ {= {A^{K_{n}}{\mathbb{e}}^{{{- \alpha}{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}} - {\int_{0}^{\infty}{A\;{\mathbb{e}}^{{- \alpha}\; t}{\mathbb{d}t}}}}}} \\ {= {A^{K_{n}}{\mathbb{e}}^{{{- \alpha}{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}} - \frac{A}{\alpha}}}} \end{matrix} & {{Equation}\mspace{14mu} 7} \end{matrix}$

We therefore have

𝕖^(−∫_(t₁)^(t₂)λ(t)dt). and combining all the data from N excitations together (independent from excitation to excitation), we have

${P\left( {\left. D \middle| A \right.,\alpha} \right)} = {{A^{K}{\mathbb{e}}^{{- {\alpha{({\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}})}}} - \frac{NA}{\alpha}}{where}\mspace{14mu} K} = {\sum\limits_{n = 1}^{N}\;{K_{n}.}}}$

Now, applying Bayes' theorem to determine the posterior, we find that

                                     Equation  8 $\begin{matrix} {{P\left( {A,\left. \alpha \middle| D \right.} \right)} = \frac{{P\left( {A,\alpha} \right)}{P\left( {\left. D \middle| A \right.,\alpha} \right)}}{\int{{P\left( {A,\alpha} \right)}{P\left( {\left. D \middle| A \right.,\alpha} \right)}{\mathbb{d}A}{\mathbb{d}\alpha}}}} \\ {\propto {\frac{r_{A}^{m_{A}}A^{m_{A} - 1}{\mathbb{e}}^{{- r_{A}}A}}{\Gamma\left( m_{A} \right)}\frac{r_{\alpha}^{m_{\alpha}}\alpha^{m_{\alpha} - 1}{\mathbb{e}}^{{- r_{\alpha}}\alpha}}{\Gamma\left( m_{\alpha} \right)}A^{K}{\mathbb{e}}^{{- {\alpha{({\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}})}}} - \frac{NA}{\alpha}}}} \\ {\propto {A^{m_{A} - 1}{\mathbb{e}}^{{- r_{A}}A}\alpha^{m_{\alpha} - 1}{\mathbb{e}}^{{- r_{\alpha}}\alpha}A^{K}{\mathbb{e}}^{{- {\alpha{({\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}})}}} - \frac{NA}{\alpha}}}} \\ {= {A^{K + m_{A} - 1}\alpha^{m_{\alpha} - 1}{\mathbb{e}}^{- {A{({r_{A} + \frac{N}{\alpha}})}}}{\mathbb{e}}^{- {\alpha{({r_{\alpha} + {\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}}})}}}}} \end{matrix}$ which gives the joint posterior distribution and hence

                                  Equation  9 $\begin{matrix} \begin{matrix} {{P\left( \alpha \middle| D \right)} = {\int{{P\left( {A,\left. \alpha \middle| D \right.} \right)}{\mathbb{d}A}}}} \\ {\propto {\int{A^{K + m_{A} - 1}\alpha^{m_{\alpha} - 1}{\mathbb{e}}^{- {A{({r_{A} + \frac{N}{\alpha}})}}}{\mathbb{e}}^{- {\alpha{({r_{\alpha} + {\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}}})}}}{\mathbb{d}A}}}} \\ {= {\alpha^{m_{a} - 1}{\mathbb{e}}^{- {\alpha{({r_{\alpha} + {\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}}})}}}{\int{A^{K + m_{A} - 1}{\mathbb{e}}^{- {A{({r_{A} + \frac{N}{\alpha}})}}}{\mathbb{d}A}}}}} \\ {= \frac{\alpha^{m_{\alpha} - 1}{\mathbb{e}}^{- {\alpha{({r_{\alpha} + {\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}}})}}}{\Gamma\left( {K + m_{A}} \right)}}{\left( {r_{A} + \frac{N}{\alpha}} \right)^{K + m_{A}}}} \end{matrix} & \; \end{matrix}$ giving the marginal distribution of a (the reciprocal of the fluorophore lifetime), while

$\begin{matrix} {{P\left( {\left. A \middle| \alpha \right.,D} \right)} = {\frac{\left( {r_{A} + \frac{N}{\alpha}} \right)^{K + m_{A}}}{\Gamma\left( {K + m_{A}} \right)}A^{K + m_{A} - 1}{{\mathbb{e}}^{- {A{({r_{A} + \frac{N}{\alpha}})}}}.}}} & {{Equation}\mspace{14mu} 10} \end{matrix}$ gives the conditional distribution of initial intensity A.

With the theoretical background above, and with reference to the flowchart of FIG. 3, an algorithm suitable for software implementation will be described. The algorithm will be denoted A1. As previous discussed, although the lifetime 1/α and the initial intensity A of the fluorophore is unknown, the user normally has some vague knowledge of the possible range of these values, that can be used to generate the prior distribution needed for the Bayesian inference.

Algorithm A1:

-   500: In a first initialising step 500, which is included in step 300     of the flowchart of FIG. 3, the user enters functions, values or     distributions describing α and A. If possible, the program may plot     the result, and the user acknowledge the outcome. -   505: In a measuring step 505, which corresponds to the steps     305-320, datasets of arrival times are collected D_(n). -   510: The Bayesian inference analysis, step 510 (corresponding     to 325) comprises the substeps (510: 1-5) of: -   510: 1 Set grid of A, α (or log A, log α). -   510: 2 Calculate

$\begin{matrix} {{P\left( {A,\left. \alpha \middle| D \right.} \right)} = {A^{K + m_{A} - 1}\alpha^{m_{\alpha} - 1}{\mathbb{e}}^{- {A{({r_{A} + \frac{N}{\alpha}})}}}{\mathbb{e}}^{- {\alpha{({r_{\alpha} + {\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}}})}}}}} & \left( {{eq}.\mspace{14mu} 8} \right) \end{matrix}$ for each combination of values of A and α

-   510: 3 Normalize the joint distribution P(A,α|D) by:     -   multiplying each grid point value of P(A,α|D) by the product         measure appropriate to that point,     -   summing over all axes, dividing the original distribution by the         result of the summation. -   510: 4 Marginalize P(A,α|D) to get P(α|D) and P(A|D) (eq. 9,10) by,     for each margin:     -   multiplying each grid point value of P(A,α|D) by the product         measure appropriate to that point,     -   summing over all axes except the axis whose margin is wanted,     -   dividing each grid point value of the resulting distribution by         the marginal measure appropriate to that point -   520: In an outputting step 520 (corresponding to 330) the resulting     distributions are presented to the user as graphs, for example.     Other measures can be calculated from the distribution for example     the marginal means with the 5^(th) and 95^(th) centiles, an often     quoted measure of the lifetime of a fluorophore.

The computational steps above usually actually need to be done by working in log P or −log P rather than in P, in order to avoid underflow and overflow. The skilled in the art will appreciate that in the calculating steps a number of obvious computational savings may be made, such as avoiding recalculating parts not changing during the summations.

The normalising step 510: 3 may preferably be performed in the following manner:

The grid of values of A are x_(h)=(x₁,x₂, . . . , x_(H)) and those of α are y_(j)=(y₁,y₂, . . . , y_(j)) Associate a measure with each x_(h) and

${y_{j}:{m\left( x_{h} \right)}} = {{\frac{x_{h + 1} + x_{h}}{2} - {\frac{x_{h} + x_{h - 1}}{2}{and}\mspace{14mu}{m\left( y_{j} \right)}}} = {{\frac{y_{j + 1} + y_{j}}{2} - {\frac{y_{j} + y_{j - 1}}{2}{and}\mspace{14mu}{m\left( {x_{h},y_{j}} \right)}}} = {{m\left( x_{h} \right)}{m\left( y_{j} \right)}}}}$

The normalised joint distribution will be given by

${P\left( {{A = x_{h}},{\alpha = \left. y_{j} \middle| D \right.}} \right)}:=\frac{P\left( {{A = x_{h}},{\alpha = \left. y_{j} \middle| D \right.}} \right)}{\sum\limits_{h}\;{\sum\limits_{j}\;{{P\left( {{A = x_{h}},{\alpha = \left. y_{j} \middle| D \right.}} \right)}{m\left( {x_{h},y_{j}} \right)}}}}$ where all the symbols indicate the values stored at the grid points and the assignment symbol := indicates new values to be stored in place of the old (which were only correct up to a constant of proportionality).

The marginalising step 510: 4 may preferably be performed by calculating:

${P\left( {A = \left. x_{h} \middle| D \right.} \right)}:={\frac{\sum\limits_{j}\;{{P\left( {{A = x_{h}},{\alpha = \left. y_{j} \middle| D \right.}} \right)}{m\left( {x_{h},y_{j}} \right)}}}{m\left( x_{h} \right)}{and}}$ ${P\left( {\alpha = \left. y_{j} \middle| D \right.} \right)}:=\frac{\sum\limits_{j}\;{{P\left( {{A = x_{h}},{\alpha = \left. y_{j} \middle| D \right.}} \right)}{m\left( {x_{h},y_{j}} \right)}}}{m\left( y_{j} \right)}$

The optional calculation of marginal means with the 5^(th) and 95^(th) centiles in the outputting step 520 may preferably be performed by calculating the cumulative density functions;

${P\left( {A \leqq x_{h}} \right)} = {{{\sum\limits_{h^{\prime} = 1}^{h}\;{{P\left( {A = x_{h^{\prime}}} \right)}{m\left( x_{h^{\prime}} \right)}\mspace{14mu}{and}\mspace{14mu}{find}\mspace{14mu}{greatest}\mspace{14mu} h\mspace{14mu}{such}\mspace{14mu}{that}\mspace{14mu}{P\left( {A \leqq x_{h}} \right)}}} \leqq {0.05\mspace{14mu}{and}\mspace{14mu}{P\left( {A \geqq x_{h}} \right)}}} = {{\sum\limits_{h^{\prime} = 1}^{h}\;{{P\left( {A = x_{h^{\prime}}} \right)}{m\left( x_{h^{\prime}} \right)}\mspace{14mu}{and}\mspace{14mu}{find}\mspace{14mu}{least}\mspace{14mu} h\mspace{14mu}{such}\mspace{14mu}{that}\mspace{14mu}{P\left( {A \geqq x_{h}} \right)}}} \leqq 0.05}}$ Single Fluorophore, with Photon-Induced, Initial, and Final Deadtimes and Unknown Lifetime

One of the major advantages with Bayesian inference is the possibility of introducing parameters describing e.g. equipment performance and artifacts in the analysis. The result will be the true distributions taking these parameters into account, rather than compensating a result with heuristic factors reflecting the artifacts, as in prior art.

Adopting the same notation as before, suppose that the detector is dead for a duration δ after each photon is received, for a duration τ after the excitation, and at all times longer than υ after excitation. Again, we must calculate the likelihood of the observed data. Let us suppose that during a excitation n, photons arrive at times t_(n,1),t_(n,2), . . . , t_(n,K) _(n) , and at no other times. As before we have the likelihood on the data D_(n) from excitation n given by

${{P\left( {\left. D_{n} \middle| A \right.,\alpha} \right)} = {\left( {\prod\limits_{k = 1}^{K_{n}}\;\left( {A\;{\mathbb{e}}^{{- \alpha}\; t_{n,k}}} \right)} \right){P\left( {\left. {{no}\mspace{14mu}{other}\mspace{14mu}{photons}} \middle| A \right.,\alpha} \right)}}},$ since in a Poisson process all events occur independently of each other. The difference between this expression and the corresponding one is in the meaning of the phrase “no other photons”; in the preceding section it meant no other photons ever, while now it just means no other photons in the time that the detector is live.

As before, this probability is

𝕖^(−∫_(T)λ(t) 𝕕t), where T now denotes the set of times at which the detector is live. We therefore have

${P\left( {\left. {{no}\mspace{14mu}{other}\mspace{14mu}{photons}} \middle| A \right.,\alpha} \right)} = {{\mathbb{e}}^{- {({{\int_{r}^{t_{n,1}}{{\lambda{(t)}}\ {\mathbb{d}t}}} + {\sum\limits_{k = 1}^{K_{n} - 1}\;{\int_{t_{n,k}}^{t_{n,k} + 1}{{\lambda{(t)}}\ {\mathbb{d}t}}}} + {\int_{t_{n,K_{n}}}^{v}{{\lambda{(t)}}\ {\mathbb{d}t}}}})}} \approx {\mathbb{e}}^{- {({{\int_{r}^{v}{{\lambda{(t)}}\ {\mathbb{d}t}}} - {\sum\limits_{k = 1}^{K_{n}}\;{\int_{t_{n,k}}^{t_{n,k} + \delta}{{\lambda{(t)}}\ {\mathbb{d}t}}}}})}}}$ where the last line follows if we make the assumption that none of the deadtimes overlap with the period following υ. Thus

$\begin{matrix} {{{P\left( {\left. {{no}\mspace{14mu}{other}\mspace{14mu}{photons}} \middle| A \right.,\alpha} \right)} \approx {\mathbb{e}}^{- {({{\int_{r}^{v}{{\lambda{(t)}}\ {\mathbb{d}t}}} - {\sum\limits_{k = 1}^{K_{n}}\;{\int_{t_{n,k}}^{t_{n,k} + \delta}{{\lambda{(t)}}\ {\mathbb{d}t}}}}})}}}\mspace{281mu} = {\mathbb{e}}^{- {({{\int_{r}^{v}{A\;{\mathbb{e}}^{{- \alpha}\; t}\ {\mathbb{d}t}}} - {\sum\limits_{k = 1}^{K_{n}}\;{\int_{t_{n,k}}^{t_{n,k} + \delta}{A\;{\mathbb{e}}^{{- \alpha}\; t}\ {\mathbb{d}t}}}}})}}} \\ {= {{\mathbb{e}}^{\frac{A}{\alpha}{({{\lbrack{\mathbb{e}}^{{- \alpha}\; t}\rbrack}_{r}^{v} - {\sum\limits_{k = 1}^{K_{n}}\;{\lbrack{\mathbb{e}}^{{- \alpha}\; t}\rbrack}_{n,k}^{n,k^{+ \delta}}}})}} = {\mathbb{e}}^{{- \frac{A}{\alpha}}{({{({{\mathbb{e}}^{{- \alpha}\;\tau} - e^{{- \alpha}\; v}})} - {\sum\limits_{k = 1}^{K_{n}}\;{({{\mathbb{e}}^{{- \alpha}\; t_{n,k}} - {\mathbb{e}}^{- {\alpha{({t_{n,k} + \delta})}}}})}}})}}}} \\ {= {{\mathbb{e}}^{{- \frac{A}{\alpha}}{({{({{\mathbb{e}}^{{- \alpha}\;\tau} - {\mathbb{e}}^{{- \alpha}\; v}})} - {\sum\limits_{k = 1}^{K_{n}}\;{({\mathbb{e}}^{{- \alpha}\;{t_{n,k}{({1 - {\mathbb{e}}^{- {\alpha\delta}}})}}})}}})}} = {\mathbb{e}}^{{- \frac{A}{\alpha}}{({{({{\mathbb{e}}^{{- \alpha}\;\tau} - {\mathbb{e}}^{{- \alpha}\; v}})} - {{({1 - {\mathbb{e}}^{- {\alpha\delta}}})}{\sum\limits_{k = 1}^{K_{n}}{\mathbb{e}}^{{- \alpha}\; t_{n,k}}}}})}}}} \end{matrix}$ so combining all the data from N excitations together (independent from excitation to excitation), we have

$\begin{matrix} {{P\left( {{D\text{|}A},\alpha} \right)} = {\prod\limits_{n = 1}^{N}\;\left( {\left( {\prod\limits_{k = 1}^{K_{n}}\;\left( {A\;{\mathbb{e}}^{{- \alpha}\; t_{n,k}}} \right)} \right){\mathbb{e}}^{{- \frac{A}{\alpha}}{({{({{\mathbb{e}}^{{- \alpha}\;\tau} - {\mathbb{e}}^{{- \alpha}\; v}})} - {{({1 - {\mathbb{e}}^{{- \alpha}\;\delta}})}{\sum\limits_{k = 1}^{K_{n}}{\mathbb{e}}^{{- \alpha}\; t_{n,k}}}}})}}} \right)}} \\ {= {A^{K}{{\mathbb{e}}^{{- {\alpha{({\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}})}}} - {\frac{A}{\alpha}{({{N{({{\mathbb{e}}^{{- \alpha}\;\tau} - {\mathbb{e}}^{{- \alpha}\; v}})}} - {{({1 - {\mathbb{e}}^{{- \alpha}\;\delta}})}{\sum\limits_{n = 1}^{N}{\sum\limits_{k = 1}^{K_{n}}{\mathbb{e}}^{{- \alpha}\; t_{n,k}}}}}})}}}.}}} \end{matrix}$

Now, applying Bayes' theorem to determine the posterior, we find that

$\begin{matrix} {{P\left( {A,{\alpha ❘D}} \right)} = {{\frac{{P\left( {A,\alpha} \right)}{P\left( {{D❘A},\alpha} \right)}}{\int{{P\left( {A,\alpha} \right)}{P\left( {{D❘A},\alpha} \right)}{\mathbb{d}A}\;{\mathbb{d}\alpha}}} \propto {\frac{r_{A}^{m_{A}}A^{m_{A} - 1}{\mathbb{e}}^{{- r_{A}}A}}{\Gamma\left( m_{A} \right)}\frac{r_{\alpha}^{m_{\alpha}}\alpha^{m_{\alpha} - 1}{\mathbb{e}}^{{- r_{\alpha}}\alpha}}{\Gamma\left( m_{\alpha} \right)}A^{K}{\mathbb{e}}^{{- {\alpha{({\sum\limits_{n = 1}^{N}{\sum\limits_{k = 1}^{K_{n}}t_{n,k}}})}}} - {\frac{A}{\alpha}{({{N{({{\mathbb{e}}^{- {\alpha\tau}} - {\mathbb{e}}^{- {\alpha\upsilon}}})}} - {{({1 - {\mathbb{e}}^{- {\alpha\delta}}})}{\sum\limits_{n = 1}^{N}{\sum\limits_{k = 1}^{K_{n}}{\mathbb{e}}^{{- \alpha}\; t_{n,k}}}}}})}}}} \propto {A^{m_{A} - 1}{\mathbb{e}}^{{- r_{A}}A}\alpha^{m_{\alpha} - 1}{\mathbb{e}}^{{- r_{\alpha}}\alpha}A^{K}{\mathbb{e}}^{{- {\alpha{({\sum\limits_{n = 1}^{N}{\sum\limits_{k = 1}^{K_{n}}t_{n,k}}})}}} - {\frac{A}{\alpha}{({{N{({{\mathbb{e}}^{- {\alpha\tau}} - {\mathbb{e}}^{- {\alpha\upsilon}}})}} - {{({1 - {\mathbb{e}}^{- {\alpha\delta}}})}{\sum\limits_{n = 1}^{N}{\sum\limits_{k = 1}^{K_{n}}{\mathbb{e}}^{{- \alpha}\; t_{n,k}}}}}})}}}}} = {A^{K + m_{A} - 1}\alpha^{m_{\alpha} - 1}{\mathbb{e}}^{- {A{({r_{A} + {\frac{1}{\alpha}{({{N{({{\mathbb{e}}^{- {\alpha\tau}} - {\mathbb{e}}^{- {\alpha\upsilon}}})}} - {{({1 - {\mathbb{e}}^{- {\alpha\delta}}})}{\sum\limits_{n = 1}^{N}{\sum\limits_{k = 1}^{K_{n}}{\mathbb{e}}^{{- \alpha}\; t_{n,k}}}}}})}}})}}}{\mathbb{e}}^{- {\alpha{({r_{\alpha} + {\sum\limits_{n = 1}^{N}{\sum\limits_{k = 1}^{K_{n}}t_{n,k}}}})}}}}}} & {{Equation}\mspace{14mu} 11} \end{matrix}$ and hence

$\begin{matrix} {\begin{matrix} {{P\left( \alpha \middle| D \right)} = {\int{{P\left( {A,\left. \alpha \middle| D \right.} \right)}{\mathbb{d}A}}}} \\ {\propto {\int{A^{K + m_{A} - 1}\alpha^{m_{\alpha} - 1}{\mathbb{e}}^{- {A{({r_{A} + {\frac{1}{\alpha}{({{N{({{\mathbb{e}}^{- {\alpha\tau}} - {\mathbb{e}}^{{- \alpha}\; v}})}} - {{({1 - {\mathbb{e}}^{- {\alpha\delta}}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha}\; t_{n,k}}}}}})}}})}}}{\mathbb{e}}^{- {\alpha{({r_{\alpha} + {\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}}})}}}{\mathbb{d}A}}}} \\ {= {\alpha^{m_{\alpha} - 1}{\mathbb{e}}^{- {\alpha{({r_{\alpha} + {\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}}})}}}{\int{A^{K + m_{A} - 1}{\mathbb{e}}^{- {A{({r_{A} + {\frac{1}{\alpha}{({{N{({{\mathbb{e}}^{- {\alpha\tau}} - {\mathbb{e}}^{{- \alpha}\; v}})}} - {{({1 - {\mathbb{e}}^{- {\alpha\delta}}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha}\; t_{n,k}}}}}})}}})}}}{\mathbb{d}A}}}}} \\ {= \frac{\alpha^{m_{\alpha} - 1}{\mathbb{e}}^{- {\alpha{({r_{\alpha} + {\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}}})}}}{\Gamma\left( {K + m_{A}} \right)}}{\left( {r_{A} + {\frac{1}{\alpha}\left( {{N\left( {{\mathbb{e}}^{- {\alpha\tau}} - {\mathbb{e}}^{{- \alpha}\; v}} \right)} - {\left( {1 - {\mathbb{e}}^{- {\alpha\delta}}} \right){\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha}\; t_{n,k}}}}}} \right)}} \right)^{K + m_{A}}}} \end{matrix}{while}} & {{Equation}\mspace{14mu} 12} \\ {{{P\left( {\left. A \middle| \alpha \right.,D} \right)} = {\frac{q^{K + m_{A}}}{\Gamma\left( {K + m_{A}} \right)}A^{K + m_{A} - 1}{\mathbb{e}}^{- {Aq}}}}{where}{q = {r_{A} + {\frac{1}{\alpha}\left( {{N\left( {{\mathbb{e}}^{- {\alpha\tau}} - {\mathbb{e}}^{{- \alpha}\; v}} \right)} - {\left( {1 - {\mathbb{e}}^{- {\alpha\delta}}} \right){\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha}\; t_{n,k}}}}}} \right)}}}} & {{Equation}\mspace{14mu} 13} \end{matrix}$ so that again the conditional posterior distribution for A given a is a Gamma distribution.

With a slight modification algorithm A1 can still be used:

In step 510: 2 P(A,α|D) will instead of equation 8 be given by equation 11 taking into account the various deadtimes:

-   520: Calculate

${P\left( {A,\left. \alpha \middle| D \right.} \right)} \propto {A^{K + m_{A} - 1}\alpha^{m_{\alpha} - 1}{\mathbb{e}}^{- {A{({r_{A} + {\frac{1}{\alpha}{({{N{({{\mathbb{e}}^{- {\alpha\tau}} - {\mathbb{e}}^{{- \alpha}\; v}})}} - {{({1 - {\mathbb{e}}^{- {\alpha\delta}}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha}\; t_{n,k}}}}}})}}})}}}{\mathbb{e}}^{- {\alpha{({r_{\alpha} + {\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; t_{n,k}}}})}}}}$ Algorithm A2, Multiple Fluorophores, Unknown Fluorophore Lifetimes, with Deadtimes.

Now we repeat the analysis, introducing the remaining complication that there are several fluorophores, with parameters given by A_(i), α_(i) for i=1, . . . , I. The deadtimes are independent of which fluorophores the photon came from.

We then have

${{P\left( {\left. D_{n} \middle| A \right.,\alpha} \right)} = {\left( {\prod\limits_{k = 1}^{K_{n}}\;\left( {\prod\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}} \right)} \right){P\left( {\left. {{no}\mspace{14mu}{other}\mspace{14mu}{photons}} \middle| A \right.,\alpha} \right)}}},$ where A denotes the vector of the A_(i)s, and α denotes the vector of α_(i)s. As before, we have

${P\left( {\left. {{no}\mspace{14mu}{other}\mspace{14mu}{photons}} \middle| A \right.,\alpha} \right)} = {{\mathbb{e}}^{- {({{\int_{r}^{t_{n,1}}{{\lambda{(t)}}\ {\mathbb{d}t}}} + {\sum\limits_{k = 1}^{K_{n} - 1}\;{\int_{t_{n,k}}^{t_{n,{k + 1}}}{{\lambda{(t)}}\ {\mathbb{d}t}}}} + {\int_{t_{n,K_{n}}}^{v}{{\lambda{(t)}}\ {\mathbb{d}t}}}})}} \approx {\mathbb{e}}^{- {({{\int_{r}^{v}{{\lambda{(t)}}\ {\mathbb{d}t}}} - {\sum\limits_{k = 1}^{K_{n}}\;{\int_{t_{n,k}}^{t_{n,k} + \delta}{{\lambda{(t)}}\ {\mathbb{d}t}}}}})}}}$ where the last line follows if we make the assumption that none of the deadtimes overlap with the period following υ. Thus

$\begin{matrix} {{{P\left( {\left. {{no}\mspace{14mu}{other}\mspace{14mu}{photons}} \middle| A \right.,\alpha} \right)} \approx {\mathbb{e}}^{- {({{\int_{r}^{v}{{\lambda{(t)}}\ {\mathbb{d}t}}} - {\sum\limits_{k = 1}^{K_{n}}\;{\int_{t_{n,k}}^{t_{n,k} + \delta}{{\lambda{(t)}}\ {\mathbb{d}t}}}}})}}}\mspace{281mu} = {\mathbb{e}}^{- {({{\int_{r}^{v}{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t}\ {\mathbb{d}t}}}} - {\sum\limits_{k = 1}^{K_{n}}\;{\int_{t_{n,k}}^{t_{n,k} + \delta}{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t}\ {\mathbb{d}t}}}}}})}}} \\ {= {{\mathbb{e}}^{\sum\limits_{i = 1}^{I}\;{\frac{A_{i}}{\alpha_{i}}{({{\lbrack{\mathbb{e}}^{{- \alpha_{i}}t}\rbrack}_{r}^{v} - {\sum\limits_{k = 1}^{K_{n}}\;{\lbrack{\mathbb{e}}^{{- \alpha_{i}}T}\rbrack}_{r_{k,n}}^{v_{n,k} + \delta}}})}}}\; = {\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{\frac{A_{i}}{\alpha_{i}}{({{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})} - {\sum\limits_{k = 1}^{K_{n}}\;{({{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}} - {\mathbb{e}}^{- {\alpha_{i}{({t_{n,k} + \delta})}}}})}}})}}}}}} \\ {= {{\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{\frac{A_{i}}{\alpha_{i}}{({{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})} - {\sum\limits_{k = 1}^{K_{n}}\;{({\mathbb{e}}^{{- \alpha_{i}}{t_{n,k}{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}}})}}})}}}}\; = {\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{\frac{A_{i}}{\alpha_{i}}{({{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}})}}}}}} \end{matrix}$ so combining all the data from N excitations together (independent from excitation to excitation), we have

$\begin{matrix} {{P\left( {\left. D \middle| A \right.,\alpha} \right)} = {\prod\limits_{n = 1}^{N}\;\left( {\left( {\prod\limits_{k = 1}^{K_{n}}\;\left( {\sum\limits_{i = 1}^{I}\mspace{11mu}{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}} \right)} \right){\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{\frac{A_{i}}{\alpha_{i}}{({{({e^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}})}}}}} \right)}} \\ {= {\left( {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}} \right){\mathbb{e}}^{- {\sum\limits_{n = 1}^{N}\;{\sum\limits_{i = 1}^{I}\;{\frac{A_{i}}{\alpha_{i}}{({{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{k = 1}^{K_{n}}\; e^{{- \alpha_{i}}t_{n,k}}}}})}}}}}}} \\ {= {\left( {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}} \right){{\mathbb{e}}^{{{- N}{\sum\limits_{i = 1}^{I}\;{\frac{A_{i}}{\alpha_{i}}{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}}}} + {\sum\limits_{i = 1}^{I}\;{({\frac{A_{i}}{\alpha_{i}}{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}})}}}.}}} \end{matrix}$

Now, applying Bayes' theorem to determine the posterior, we find that

$\begin{matrix} \begin{matrix} {{P\left( {A,\left. \alpha \middle| D \right.} \right)} = \frac{{P\left( {A,\alpha} \right)}{P\left( {\left. D \middle| A \right.,\alpha} \right)}}{\int{{P\left( {A,\alpha} \right)}{P\left( {\left. D \middle| A \right.,\alpha} \right)}{\mathbb{d}A}{\mathbb{d}\alpha}}}} \\ {\propto {\prod\limits_{i = 1}^{I}\;{\frac{r_{A_{i}}^{m_{A_{i}}}A_{i}^{m_{A_{i}} - 1}{\mathbb{e}}^{{- r_{A_{i}}}A_{i}}}{\Gamma\left( m_{A_{i}} \right)}{\prod\limits_{i = 1}^{I}\;\frac{r_{\alpha_{i}}^{m_{\alpha_{i}}}\alpha_{i}^{m_{\alpha_{i}} - 1}{\mathbb{e}}^{{- r_{\alpha_{i}}}\alpha_{i}}}{\Gamma\left( m_{\alpha_{i}} \right)}}}}} \\ {\left( {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}} \right){\mathbb{e}}^{{{- N}{\sum\limits_{i = 1}^{I}\;{\frac{A_{i}}{\alpha_{i}}{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}}}} + {\sum\limits_{i = 1}^{I}\;{({\frac{A_{i}}{\alpha_{i}}{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}})}}}} \\ {\propto {\left( {\prod\limits_{i = 1}^{I}\;{A_{i}^{m_{A_{i}} - 1}\alpha_{i}^{m_{\alpha_{i}} - 1}}} \right)\left( {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}} \right)}} \\ {{\mathbb{e}}^{{- {\sum\limits_{i = 1}^{I}\;{r_{A_{i}}A_{i}}}} - {\sum\limits_{i = 1}^{I}\;{r_{\alpha_{i}}\alpha_{i}}} - {N{\sum\limits_{i = 1}^{I}\;{\frac{A_{i}}{\alpha_{i}}{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}}}} + {\sum\limits_{i = 1}^{I}\;{({\frac{A_{i}}{\alpha_{i}}{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}})}}}} \\ {= {\left( {\prod\limits_{i = 1}^{I}\;{A_{i}^{m_{A_{i}} - 1}\alpha_{i}^{m_{\alpha_{i}} - 1}}} \right)\left( {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}} \right){\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{({{r_{A_{i}}A_{i}} + {r_{\alpha_{i}}\alpha_{i}} + {\frac{A_{i}}{\alpha_{i}}{({{N{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}})}}})}}}}} \end{matrix} & {{Equation}\mspace{14mu} 14} \end{matrix}$

We now use algorithm A2, which though it appears similar to A1 differs in step 520 where P(A,α|D) will be given, instead of by equation 8, by equation 14 taking into account the various deadtimes and the possibility of a plurality of unknown fluorophore lifetimes and/or intensities.

-   510: 2 Calculate, for each point on the multidimensional grid,

${P\left( {A,\left. \alpha \middle| D \right.} \right)} = {\left( {\prod\limits_{i = 1}^{I}\;{A_{i}^{m_{A_{i}} - 1}\alpha_{i}^{m_{\alpha_{i}} - 1}}} \right)\left( {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}} \right){\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{({{r_{A_{i}}A_{i}} + {r_{\alpha_{i}}\alpha_{i}} + {\frac{A_{i}}{\alpha_{i}}{({{N{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}})}}})}}}}$

As can be understood both from the appearance of equation 14 and, more importantly, from the fact that the grid is now multidimensional, this alternative of algorithm A1 will often be computational heavy and time-consuming.

Algorithm A3, Multiple Fluorophores with Known Lifetimes

A third embodiment of the inventive method of the present invention refers to measurement cases in which the lifetimes of the fluorophores in the sample are known. This can be the case for example when complex organic molecules are “tagged” with known fluorophores. The wanted measure may then be for example the quantities of the fluorophores, reflected in the initial intensities A_(i), or the ratios between the quantities of the different fluorophores, reflected in the ratios of the initial intensities A_(i).

Equation 14 above is simplified in the case of known lifetimes:

${P\left( A \middle| D \right)} \propto {\left( {\prod\limits_{i = 1}^{I}\; A_{i}^{m_{A_{i}} - 1}} \right)\left( {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}} \right){\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{({{r_{A_{i}}A_{i}} + {\frac{A_{i}}{\alpha_{i}}{({{N{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}})}}})}}}}$ but this is not sufficient to get a simple fast implementation, because of the number of terms in the second factor. By, in addition, inferring which fluorophore each photon came from it will be shown that the computation can be simplified, and hence the time needed for the Bayesian inference analysis is significantly shorter. Surprisingly, we gain here by introducing a large number of extra variables—in fact we introduce I new variables per photon received. For each photon φ_(n,k) received we introduce the I variables s_(n,k,i), which is defined to be 1 if φ_(n,k) is emitted by fluorophore i and is 0 otherwise. The s variable tells which fluorophore a photon originates from. Let S denote the Cartesian product of all these new variables.

We can then recomplicate the above equation as follows:

$\begin{matrix} {{P\left( A \middle| D \right)} = {{\int{{P\left( {A,\left. S \middle| D \right.} \right)}{\mathbb{d}S}}} = \frac{\int{{P(A)}{P\left( D \middle| A \right)}{P\left( {\left. S \middle| D \right.,A} \right)}{\mathbb{d}S}}}{P(D)}}} \\ {\propto {\int{\left( {\prod\limits_{i = 1}^{I}\; A_{i}^{m_{A_{i}} -}} \right)\left( {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}} \right){\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{({{r_{A_{i}}A_{i}} + {\frac{A_{i}}{\alpha_{i}}{({{N{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}})}}})}}}{P\left( {\left. S \middle| D \right.,A} \right)}{\mathbb{d}S}}}} \end{matrix}$ ${Now},\begin{matrix} {{P\left( {\left. S \middle| D \right.,A} \right)} = {{\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{P\left( {\left. s_{n,k} \middle| D \right.,A} \right)}}} = {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{P\left( {\left. s_{n,k} \middle| {{photon}\mspace{14mu}{referred}\mspace{14mu}{to}\mspace{14mu}{by}\mspace{14mu} s_{n,k}\mspace{11mu}{is}\mspace{14mu}{at}\mspace{14mu} t_{n,k}} \right.,A} \right)}}}}} \\ {= {{\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;\frac{P\left( {{there}\mspace{14mu}{is}\mspace{14mu} a\mspace{14mu}{photon}\mspace{14mu}{from}\mspace{14mu}{fluor}\mspace{14mu} i\mspace{14mu}{at}\mspace{14mu} t_{n,k}} \middle| A \right)}{\sum\limits_{i = 1}^{I}{P\left( {{there}\mspace{14mu}{is}\mspace{14mu} a\mspace{14mu}{photon}\mspace{14mu}{from}\mspace{14mu}{fluor}\mspace{14mu} i\mspace{14mu}{at}\mspace{14mu} t_{n,k}} \middle| A \right)}}}} = {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;\frac{\sum\limits_{i = 1}^{I}\;{s_{n,k,i}A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}}}} \end{matrix}$ therefore $P\begin{matrix} {\left( A \middle| D \right) \propto {\int{\left( {\prod\limits_{i = 1}^{I}\; A_{i}^{m_{A_{i}} - 1}} \right)\left( {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;\left( {\frac{\sum\limits_{i = 1}^{I}\;{s_{n,k,i}A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}} \right)}} \right){\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{({{r_{A_{i}}A_{i}} + {\frac{A_{i}}{\alpha_{i}}{({{N{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}})}}})}}}{\mathbb{d}S}}}} \\ {= {\int{\left( {\prod\limits_{i = 1}^{I}\; A_{i}^{m_{A_{i}} - 1}} \right)\left( {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{\sum\limits_{i = 1}^{I}\;{s_{n,k,i}A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}} \right){\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{({{r_{A_{i}}A_{i}} + {\frac{A_{i}}{\alpha_{i}}{({{N{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}})}}})}}}{\mathbb{d}S}}}} \end{matrix}$

By simply removing the integration throughout the above argument, we can also arrive at

$\begin{matrix} {{P\left( {A,\left. S \middle| D \right.} \right)} \propto {\left( {\prod\limits_{i = 1}^{I}\; A_{i}^{m_{A_{i}} - 1}} \right)\left( {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{\sum\limits_{i = 1}^{I}\;{s_{n,k,i}A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}} \right){\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{({{r_{A_{i}}A_{i}} + {\frac{A_{i}}{\alpha_{i}}{({{N{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}})}}})}}}}} & {{Equation}\mspace{14mu} 15} \end{matrix}$ which is the starting point for algorithm A3.

We now plan to take random samples from the joint distribution of A and S. In order to do so we will use Markov Chain Monte Carlo techniques. In particular, given a random sample (A_(j),S_(j)) we will, if j is even, set S_(j+1) equal to S_(j), and draw A_(j+1), from P(A|S_(j+1)), and if j is odd, set A_(j+1) equal to A_(j) and draw S_(j+1), from P(S|A_(j+1)).

Drawing S_(j+1) from P(S↑A_(j+1)) is easy, because this conditional distribution of S is separable over its K components S_(n,k), and each of these is a simple discrete distribution:

$\begin{matrix} \begin{matrix} {{P\left( {\left. S \middle| A \right.,D} \right)} \propto {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{\sum\limits_{i = 1}^{I}\;{s_{n,k,i}A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}}} \\ {{\therefore{P\left( {{s_{n,k,i} = 1},{{\left( {\forall{i^{\prime} \neq i}} \right)s_{n,k,i^{\prime}}} = \left. 0 \middle| A \right.},D} \right)}} = \frac{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}} \end{matrix} & {{Equation}\mspace{14mu} 16} \end{matrix}$ and each s_(n,k) may be handled independently.

Drawing A_(j+1) from P(A|S_(j+1)) requires sampling from 1 Gamma distributions; how to do this will be exemplified in an appendix. The distributions in question are given by:

$\begin{matrix} \begin{matrix} {{P\left( {\left. A \middle| S \right.,D} \right)} \propto {\left( {\prod\limits_{i = 1}^{I}\; A_{i}^{m_{A_{i}} - 1}} \right)\left( {\prod\limits_{i = 1}^{I}\;{\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{A_{i}e^{{- a_{i}}t_{n,k}}}}}} \right)e^{- {\sum\limits_{i = 1}^{I}\;{({{r_{A_{i}}A_{i}} + {\frac{A_{i}}{a_{i}}{({{N{({e^{{- a_{i}}\tau} - e^{{- a_{i}}v}})}} - {{({1 - e^{{- a_{i}}\delta}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; e^{{- a_{i}}t_{n,k}}}}}})}}})}}}}} \\ {{\therefore{P\left( {\left. A_{i} \middle| S \right.,D} \right)}} = {A_{i}^{m_{A_{i}} - 1 + {\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; s_{n,k,i}}}}e^{- {A_{i}{({r_{A_{i}} + {\frac{1}{a_{i}}{({{N{({e^{{- a_{i}}\tau} - e^{{- a_{i}}v}})}} - {{({1 - e^{{- a_{i}}\delta}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; e^{{- a_{i}}t_{n,k}}}}}})}}})}}}}} \end{matrix} & {{Equation}\mspace{14mu} 17} \end{matrix}$

Having got our sequence of random samples (A₁,S₁),(A₂,S₂), . . . we convert it into a sequence of samples of A by discarding the values of S.

With the theoretical background above, and with reference to the flowchart of FIG. 3, an algorithm suitable for software implementation will be described. The algorithm will be denoted A3.

Algorithm A3:

-   600: In a first initialising step 600, which is included in step 300     of the flowchart of FIG. 3, the user enters functions, values or     distributions describing a and A. -   600: 1 a) If based on information from previous experiments: -   600: 1.1 i) and if posterior of previous experiments are of Gamma     form (eq. 3):     -   copy m and r from the posterior of the previous experiment -   600: 1.2 ii) if other distribution form, e.g. f(A_(i)):     -   plot f(A_(i)) and adjust m_(A) _(i) ,r_(A) _(i) until Gamma         functions mimic f(A_(i)) or     -   consider information loss

$I_{m,r} = {\int{{f(A)}\log\frac{f(A)}{\Gamma_{m,r}(A)}{\mathbb{d}A}}}$ and adjust m and r

-   -   for minimum I_(m,r) using some minimisation routine.

-   600: 2 b) If information is vague knowledge of fluorophore; for each     fluorophore pick m_(A) _(i) ,r_(A) _(i) , so that distribution fits     “mental image”:

-   600: 2.1 i) for each A_(i) do

-   600: 2.1.1 a) pick m_(A) _(i) >0 (that the larger the value the     narrower the prior)

-   600: 2.1.2 b) pick mean μ of prior (e.g. 10⁸ meaning 1 photon per 10     ns)

-   600: 2.1.3 c) set r_(A) _(i) =m_(A) _(i) /μ

-   600: 2.1.4 d) plot prior on screen (linear or log scale)

-   600: 2.1.5 e) Does the plot fit the mental image desired? Yes—new     A_(i)(goto i), No—repeat (a) to (e) as necessary

-   605: In a measuring step 605, which corresponds to the steps     305-320, datasets of arrival times are collected D_(n).

-   610: The Bayesian inference analysis, step 610 (corresponding     to 325) comprises the substeps (610: 1-4) of:

-   610: 1 Initialize:

-   610: 1.1 set number of samples required

-   610: 1.2 select a starting value for each 4, options:     -   i) select random sample from prior on A_(i)     -   ii) select mean from prior on A_(i)     -   iii) select mode from prior on A_(i)     -   iv) user input data

-   610: 2 Update S(s_(n,k) representing the source of each photon)

-   610: 2.1 For each n(1, 2, . . . , K_(n))

-   610: 2.1.1 For each k(1, 2, . . . , K_(n))

-   610: 2.1.1.1 Update s_(n,k):     -   select a random sample from the discrete distribution (eq. 17):

${P\left( {{s_{n,k,i} = 1},{{\left( {\forall{i^{\prime} \neq i}} \right)s_{n,k,i^{\prime}}} = \left. 0 \middle| A \right.},D} \right)} = \frac{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}$

-   610: 2.1.2 Next k -   610: 2.2 Next n -   610: 3 Update A -   610: 3.1 For each i(1, 2, . . . , I) -   610: 3.1.1 Update A_(i): -   610: 3.1.1.1 Calculate

$m = {m_{A_{i}} + {\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; s_{n,k,i}}}}$

-   610: 3.1.1.2 Calculate

$r_{i} = {r_{A_{i}} + {\frac{1}{\alpha_{i}}\left( {{N\left( {{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}} \right)} - {\left( {1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}} \right){\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}} \right)}}$

-   610: 3.1.1.3 Set new value of A_(i) to be a random sample from the     Gamma distribution with parameters m, r_(i) (see Appendix) -   610: 3.1 Next i -   610: 4 Add value of A to list of samples of A -   610: 5 Enough samples? Yes—goto 620, No—repeat 610: 2-5 -   620: In an outputting step 620 (corresponding to 330) the resulting     list of samples is presented to the user. Optionally histograms     (corresponding to the marginal distributions of previous algorithms)     can be presented. Other measures can be calculated from the     histograms for example the marginal means with the 5^(th) and     95^(th) centiles.

Alternatively it is equally feasible to start with the source variables S. The algorithm would be slightly modified, the important modifications are:

-   610: 1 Initialize:     -   select some value at random for each s′_(n,k) defined by

$s_{n,k}^{\prime} \equiv {\sum\limits_{i = 1}^{I}\;{is}_{n,k,i}}$ from the set {1, 2, . . . , I} and

-   610: 2 Update A -   610: 3 Update S

Note that the procedure, in step 610: 3, to draw a random sample from the Gamma distribution with parameters m,r_(i) can be done in various ways. A suitable method will be described in the Appendix.

FIG. 5 illustrates three prior distributions entered by a user in substep 610:1. In FIG. 6 is a typical output from step 620 shown. FIG. 6 shows histograms for three different fluorophores. The x-marked lines indicate true values.

As apparent to the skilled in the art the above algorithm can be converted to software code in many different ways and care should be taken to achieve computationally effective and efficient code, e.g. in the loops calculate only the parts that change in the loop. Such, and other simplifications, should be obvious to the skilled programmer and not considered to be a part of the invention.

Algorithms A4, A5, and A6: Multiple Fluorophores with Known Lifetimes and Binning of the Photon Times

In a further embodiment of the inventive method of the present invention the previous algorithm (A3) is modified to also account for the fact that the measurement system has a finite resolution in time. The resolution of the instrument is typically given by the sampling rate of the photon timing unit 150, which could be of the order of 2G samples/s, giving a resolution of 0.5 ns. The finite resolution has the effect that it is not possible to separate in time photons arriving less than the time resolution apart; they are “binned” together. Instead of a set of arrival times, the data really consist of a fixed set of bin positions and for each excitation the number of photons arriving in each bin. This binning in time of the arrival times of the photons can be advantageously utilized in the Bayesian inference analysis; indeed algorithm A4 may in some ways be more useful than A3 even when the data are not binned, as it is easy to bin the data before using an inference algorithm.

Considering the procedure of algorithm A3, and in particular the step when we resample A_(j+1) from P(A|S_(j+1)), we note that the only dynamic information we need to do this, other than the photon arrival times, is the set of quantities

${\sum\limits_{n = 1}^{N}{\sum\limits_{k = 1}^{K_{n}}s_{n,k,i}}},$ as we can see from the resampling equation (which defines the parameters of a Gamma distribution):

$\begin{matrix} {{P\left( {{A_{i}\text{|}S},D} \right)} = {A_{i}^{m_{A_{i}} - 1 + {\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\; s_{n,k,i}}}}{{\mathbb{e}}^{- {A_{i}{({r_{A_{i}} + {\frac{1}{\alpha_{i}}{({{N{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{n = 1}^{N}{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}})}}})}}}.}}} & {{Equation}\mspace{14mu} 18} \end{matrix}$

However, this set of quantities simply tells us how many photons are believed, by the current posterior sample, to come from each fluorophore.

Similarly, when resampling S_(j+1) from P(S|A_(j+1)), the only dynamic information we need is the value of A_(j+1), as can be seen from the resampling equation (which defines a discrete distribution):

$\begin{matrix} {{P\left( {{s_{n,k,i} = 1},{{\left( {\forall{i^{\prime} \neq i}} \right)s_{n,k,j^{\prime}}} = \left. 0 \middle| A \right.},D} \right)} = {\frac{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}.}} & {{Equation}\mspace{14mu} 19} \end{matrix}$

Thus it doesn't matter whether we remember or forget which photon is currently believed to come from which fluorophore; simply remembering how many there are in each time bin, and how many (total) are allocated to each fluorophore, is sufficient.

Instead of keeping track of, and resampling, the S variables then, we need only remember, and resample, the number of photons in each time bin believed to come from each fluorophore.

Formally then, we define b_(k,i) to be the number of photons in time bin k that came from fluorophore i, taking all the excitations together. Let c_(n,k) be the total number of photons in time bin k of excitation n; then C constitutes the data. Let d_(k) be the midtime of bin k and w_(k) be its width; we assume that for all other t in that same bin

𝕖^(−max_(i)(α_(i))_(t)) differs negligibly from

${\mathbb{e}}^{- {\max\limits_{i}{{(\alpha_{i})}d_{k}}}}$ (and if this is not so we will use algorithm A7 below instead).

As can be seen from the resampling equation for S_(j+1) therefore, the conditional distribution of b_(k) given A_(j+1) will be multinomial, with multi-way toss probabilities given by

${{{EMBED}\frac{w_{k}A_{i}{\mathbb{e}}^{{- \alpha_{i}}d_{k}}}{\sum\limits_{i = 1}^{I}\;{w_{k}A_{i}{\mathbb{e}}^{{- \alpha_{i}}d_{k}}}}} = \frac{A_{i}{\mathbb{e}}^{{- \alpha_{i}}d_{k}}}{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}d_{k}}}}},$ and total number of tosses

$\begin{matrix} {\sum\limits_{n = 1}^{N}\;{c_{n,k}.}} & {{Equation}\mspace{14mu} 20} \end{matrix}$

For odd j we now draw a sample from a multinomial distribution with the multi-way toss probabilities defined above, while for even j we resample A_(j+1) according to

$\begin{matrix} {{P\left( {\left. A_{i} \middle| B \right.,D} \right)} = {A_{i}^{m_{A_{i}} - 1 + {\sum\limits_{k = 1}^{K}\; b_{k,i}}}{\mathbb{e}}^{- {A_{i}{({r_{A_{i}} + {\frac{1}{\alpha_{i}}{({{N{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K}\;{c_{n,k}{\mathbb{e}}^{{- \alpha_{i}}d_{k}}}}}}})}}})}}}}} & {{Equation}\mspace{14mu} 21} \end{matrix}$

How to draw samples from a multinomial distribution efficiently will be shown in appendix. Asymptotically it takes only as long as the square root of the total number of photons in the bin multiplied by the largest toss probability. The run time is no longer, as in algorithm A3, proportional to the number of photons received, but to the square root of that number.

With the above reasoning and derivation algorithm A3 can be modified accordingly and is described below and with references to the flowcharts of FIG. 3.

Algorithm A4:

-   700: In a first initialising step 700, which is included in step 300     of the flowchart of FIG. 3, the user enters functions, values or     distributions describing α and A. -   700: 1 a) If information from previous experiments: -   700: 1.1 i) and if posterior of previous experiments are of Gamma     form (eq. 3):     -   copy m and r from the posterior of the previous experiment -   700: 1.2 ii) if other distribution form, e.g. f(A_(i)):     -   plot f(A_(i)) and adjust m_(A) _(i) ,r_(A) _(i) until Gamma         functions mimics f(A_(i)) or     -   consider information loss

$I_{m,r} = {\int{{f(A)}\log\frac{f(A)}{\Gamma_{m,r}(A)}{\mathbb{d}A}}}$ and adjust m and r for minimum I_(m,r) using some minimisation routine.

-   700: 2 b) If information is vague knowledge of fluorophore; for each     fluorophore pick m_(A) _(i) ,r_(A) _(i) r so that distribution fits     “mental image”: -   700: 2.1 i) for each A_(i) do -   700: 2.1.1 a) pick m_(A) _(i) >0 (that the larger the value the     narrower the prior) -   700: 2.1.2 b) pick mean μ of prior (e.g. 1080-1 photon per 10 ns) -   700: 2.1.3 c) set r_(A) _(i) =m_(A) _(i) /μ -   700: 2.1.4 d) plot prior on screen (linear or log scale) -   700: 2.1.5 e) does the plot match the desired mental image? Yes—new     A_(i) (goto i), No—repeat (a) to (e) as necessary -   705: In a measuring step 705, which corresponds to the steps     305-320, datasets of arrival times are collected D_(n). -   710: The Bayesian inference analysis, step 710 (corresponding     to 325) comprises the substeps (710: 1-4) of: -   710: 1 Initialize: -   710: 1.1 set bin size and position (from hardware design) -   710: 1.2 count photons in each time bin:

$c_{k} = {\sum\limits_{n = 1}^{N}\; c_{n,k}}$

-   710: 1.3 set number of samples required -   710: 1.4 select starting value for each A_(i), options:     -   i) select random sample from prior on A_(i)     -   ii) select mean from prior on A_(i)     -   iii) select mode from prior on A_(i)     -   iv) user input data -   710: 2 Update B -   710: 2.1 For each k(1, 2, . . . , K) -   710: 2.1.1 Update b_(k) -   710: 2.1.1.1 set b_(k) to be a random sample from the multinomial     distribution with

$c_{k} = {\sum\limits_{n = 1}^{N}\; c_{n,k}}$ total tosses and toss probabilities

$p_{i} = {\frac{A_{i}{\mathbb{e}}^{{- \alpha_{i}}d_{k}}}{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}d_{k}}}}\left( {{see}\mspace{14mu}{Appendix}} \right)}$

-   710: 2.2 Next k -   710: 3 Update A -   710: 3.1 For each i(1, 2, . . . , I) -   710: 3.1.1 Update A_(i) -   710: 3.1.1.1 Calculate

$m = {m_{A_{i}} + {\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K}\; b_{k,i}}}}$

-   710: 3.1.1.2 Calculate

$r_{i} = {r_{A_{i}} + {\frac{1}{\alpha_{i}}\left( {{N\left( {{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}} \right)} - {\left( {1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}} \right){\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K}\;{c_{k}{\mathbb{e}}^{{- \alpha_{i}}d_{k}}}}}}} \right)}}$

-   710: 3.1.1.3 Set new value of A_(i) to be a random sample from the     Gamma distribution with parameters m, r_(i) (see Appendix) -   710: 3.2 Next i -   710: 4 Add value of A to list of samples of A -   710: 5 Enough samples? Yes—goto 720, No—repeat 710: 1-5 -   720: In an outputting step 720 (corresponding to 330) the resulting     list of samples is presented to the user. Optionally histograms     (corresponding to the marginal distributions of previous algorithms)     can be presented. Other measures can be calculated from the     histograms for example the marginal means with the 5^(th) and     95^(th) centiles and/or fractions of total intensity.

Similarly to previous algorithm it is possible to reverse the order of updating A and B with slight modifications of the algorithm.

The majority of the running time of algorithm A4 is occupied in drawing random samples from multinomial distributions (substep 710: 2). Replacing those samples with their mean will result in a faster algorithm. A noticeable deterioration in accuracy of the result can be expected, although under some circumstances it may still be considered usable. The algorithm modified in this way will be referred to as A5, A further simplification is to replace the Gamma samples (substep 710: 3) with their means, which will result in an even faster but very inaccurate algorithm, which will be referred to as A6.

Algorithm A7. Multiple Fluorophore with Known Lifetimes and Binning of the Photon Times in Bins and Subbins

A further embodiment of the inventive method of the present invention illustrates the power and usefulness of the method. Suppose the bins introduced in the previous algorithm are too large, i.e. the resolution of the instrument is lower than apparently needed for the specific measurement. The algorithm described below, will by introducing subbins, dividing each bin into a number of subbins, make it possible to extract information that would otherwise been obscured by the resolution of the instrument. The subbins do not necessarily have to be of equal size, for example they could be spaced logarithmically; nor is it necessary that each bin contains the same number of subbins as each other bin.

We now introduce a number of extra variables similar to the B variables, but indicating not only which fluorophore each photon comes from, but also which subbin it falls in within the bin in which it is known to fall.

Resampling of A_(j+1) from P(A|B_(j,+1)) occurs in exactly the same way as in A4. Resampling of B_(j+1) from P(B|A_(j+1)), however, now occurs over, for each bin, a multinomial distribution with the number of options being the product of the number of fluorophores and the number of subbins, and the total number of tosses being the total number of photons in that bin, and the multi-way toss probabilities being determined by the subbin centre time and fluorophore decay time that are relevant. Finally, of course, we discard the subbin information just as we discard the B variable information.

In detail then, suppose the original time bins are centered on times d_(k) as before, but that bin k is now divided into L_(k) subbins with times centered on d_(k,l) and of width w_(k,j). Similarly, let b_(k,i,l) denote the number of photons currently supposed to have come from fluorophore i and to be in subbin l of bin k. Then the multinomial distribution over which we have to resample b_(k) has now IL_(k) possible toss outcomes, still with

             Equation  22 ${EMBED},\frac{w_{k,l}A_{i}{\mathbb{e}}^{{- \alpha_{i}}d_{k,l}}{\mathbb{e}}^{\sum\limits_{i^{\prime} = 1}^{I}\;{({\frac{A_{i^{\prime}}}{\alpha_{i^{\prime}}}{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{k = 1}^{K}\;{\mathbb{e}}^{{- \alpha_{i^{\prime}}}d_{k,l}}}})}}}{\sum\limits_{i = 1}^{i}\;{\sum\limits_{l = 1}^{L_{k}}\;{w_{k,l}A_{i}{\mathbb{e}}^{{- \alpha_{i}}d_{k,l}}{\mathbb{e}}^{\sum\limits_{i^{\prime} = 1}^{I}\;{({\frac{A_{i^{\prime}}}{\alpha_{i^{\prime}}}{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{k = 1}^{K}\;{\mathbb{e}}^{{- \alpha_{i^{\prime}}}d_{k,l}}}})}}}}}$ total tosses. However, calculating the toss probabilities is slightly more difficult than it was before. Working from equation 20 for P(A,S|D), we find that the probability for toss outcome (i,l) in bin k is

$\sum\limits_{n = 1}^{N}\; c_{n,k}$ while when resampling A_(j+1) we must work from

                                      Equation  23 ${{P\left( {\left. A_{i} \middle| B \right.,D} \right)} = {A_{i}^{m_{A_{i}} - 1 + {\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\; b_{k,i,j}}}}{\mathbb{e}}^{- {A_{i}{({r_{A_{i}} + {\frac{1}{\alpha_{i}}{({{N{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\;{({{\mathbb{e}}^{{- \alpha_{i}}d_{k,l}}{\sum\limits_{i^{\prime} = 1}^{I}\; b_{k,l^{\prime},l}}})}}}}})}}})}}}}},$ which as usual is a Gamma distribution.

With the above reasoning and derivation, algorithm A4 can be modified accordingly and is described below and with references to the flowcharts of FIG. 3. The modifications occur in the substeps of the Bayesian inference analysis, substeps 810; 1-5 corresponding to step 710: 1-5 of algorithm A4, only. Therefore only these substeps are described below.

Algorithm A7:

-   -   810: 1 The Bayesian inference analysis, step 810 (corresponding         to 710) comprises the substeps of:     -   810: 1 Initialize:     -   810: 1.1 set bin size and position: d_(k) (k=1, 2, . . . , K)         (from hardware design)     -   810: 1.2 set subbin size and position for each k: d_(k,j) (l=1,         2, . . . , L_(k)) (inside d_(k)'s bin)     -   810: 1.3 count photons in each time bin:

$c_{k} = {\sum\limits_{n = 1}^{N}\; c_{n,k}}$

-   -   810: 1.4 set number of samples required     -   810: 1.5 select starting value for each A_(i), options:         -   i) select random sample from prior on A_(i)         -   ii) select mean from prior on A_(i)         -   iii) select mode from prior on A_(i)         -   iv) user input data     -   810: 2 Update B     -   810: 2.1 For each k(1, 2, . . . , K)     -   810: 2.1.1 Update b_(k):     -   set b_(k) to be a random sample from the multinomial         distribution with

$c_{k} = {\sum\limits_{n = 1}^{N}\; c_{n,k}}$ total tosses, IL_(k) outcomes and toss probability

${EMBED}\frac{w_{k,l}A_{i}{\mathbb{e}}^{{- \alpha_{i}}d_{k,j}}{\mathbb{e}}^{\sum\limits_{i^{\prime} = 1}^{I}\;{({\frac{A_{i^{\prime}}}{\alpha_{i^{\prime}}}{({1 - {\mathbb{e}}^{{- \alpha_{i^{\prime}}}\delta}})}{\sum\limits_{k = 1}^{K}\;{\mathbb{e}}^{{- \alpha_{i^{\prime}}}d_{k,l}}}})}}}{\sum\limits_{i = 1}^{i}\;{\sum\limits_{l = 1}^{L_{k}}\;{w_{k,l}A_{i}{\mathbb{e}}^{{- \alpha_{i}}d_{k,l}}{\mathbb{e}}^{\sum\limits_{i^{\prime} = 1}^{I}\;{({\frac{A_{i^{\prime}}}{\alpha_{i^{\prime}}}{({1 - {\mathbb{e}}^{{- \alpha_{i^{\prime}}}\delta}})}{\sum\limits_{k = 1}^{K}\;{\mathbb{e}}^{{- \alpha_{i^{\prime}}}d_{k,l}}}})}}}}}$ (see  Appendix)

-   -   810: 2.2 Next k     -   810: 3 Update A     -   810: 3.1 For each i(1, 2, . . . , I)     -   810: 3.1.1 Update A_(i):

-   810: 3.1.1.1 Calculate

$m = {m_{A_{i}} + {\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\; b_{k,i,l}}}}$

-   -   810: 3.1.1.2 Calculate

$r_{i} = {r_{A_{i}} + {\frac{1}{\alpha_{i}}\left( {{N\left( {{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}} \right)} - {\left( {1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}} \right){\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\;{\left( {\mathbb{e}}^{{- \alpha_{i}}d_{k}} \right){\sum\limits_{i^{\prime} = 1}^{I}\; b_{k,i^{\prime},l}}}}}}} \right)}}$

-   -   810: 3.1.1.3 Set new value of A_(i) to be a random sample from         the Gamma distribution with parameters m,r_(i)(see Appendix)     -   810: 3.2 Next i     -   810: 4 Add value of A to list of samples of A     -   810: 5 Enough samples? Yes—goto 820, No—repeat 810: 2-5

Just as in the previous algorithm it is possible to reverse the order of updating A and B with slight modifications of the algorithm.

Algorithm A8, Multiple Fluorophore with Unknown Lifetimes and Binning of the Photon Times in Bins and Subbins

The principle of binning of the photon arrival times in bins and subbins can be utilized also in the case of multiple fluorophores with unknown lifetimes, which will be illustrated below in an embodiment of the present invention. It can be seen as a generalization of algorithm A7. As before when the lifetimes are unknown, we presume Gamma priors on them. The simplifications that result in the simpler case where (∀k)L_(k)=1 should be obvious.

As enunciated in the description of algorithm A2 above, the posterior here before binning is given by

$\begin{matrix} {{{P\left( {A,\left. \alpha \middle| D \right.} \right)} \propto {\left( {\prod\limits_{i = 1}^{I}\;{A_{i}^{m_{A_{i}} - 1}\alpha_{i}^{m_{\alpha_{i}} - 1}}} \right)\left( {\prod\limits_{n = 1}^{N}\;{\prod\limits_{k = 1}^{K_{n}}\;{\sum\limits_{i = 1}^{I}\;{A_{i}{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}} \right)}}{\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{({{r_{A_{i}}A_{i}} + {r_{\alpha_{i}}\alpha_{i}} + {\frac{A_{i}}{\alpha_{i}}{({{N{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}\nu}})}} - {{({1 - e^{{- a_{i}}\delta}})}{\sum\limits_{n = 1}^{N}\;{\sum\limits_{k = 1}^{K_{n}}\;{\mathbb{e}}^{{- \alpha_{i}}t_{n,k}}}}}})}}})}}}} & {{Equation}\mspace{14mu} 24} \end{matrix}$ while with binned data and the additional variables, using the notation of the last algorithms, we have

$\begin{matrix} {{{{EMBED}\left( {A,\alpha,\left. B \middle| D \right.} \right)} \propto \left( {\prod\limits_{k = 1}^{K}\;{\prod\limits_{l = 1}^{L_{k}}\; w_{k,l}^{\sum\limits_{i = 1}^{I}\; b_{k,i,l}}}} \right)}{\left( {\prod\limits_{i = 1}^{I}\;{A_{i}^{m_{A_{i}} - 1 + {\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\; b_{k,i,l}}}}\alpha_{i}^{m_{\alpha_{i}} - 1}}} \right) \cdot {\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{({{r_{A_{i}}A_{i}} + {\alpha_{i}{({r_{\alpha_{i}} + {\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\;{b_{k,i,l}d_{k,l}}}}})}} + {\frac{A_{i}}{\alpha_{i}}{({{N{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\;{({{\mathbb{e}}^{{- \alpha_{i}}d_{k,l}}{\sum\limits_{i^{\prime} = 1}^{I}\; b_{k,i^{\prime},l}}})}}}}})}}})}}}}} & {{Equation}\mspace{14mu} 25} \end{matrix}$ under the constraint that for all k we have

${\sum\limits_{l = 1}^{L_{k}}\;{\sum\limits_{i = 1}^{I}\; b_{k,i,l}}} = {\sum\limits_{n = 1}^{N}\; c_{n,k}}$ (and otherwise P(A,α,B|D)=0).

It is now easy to write down the conditional distributions:

                                      Equation  26 ${P\left( {\left. A \middle| \alpha \right.,B,D} \right)} \propto \left( {\prod\limits_{i = 1}^{I}\; A_{i}^{m_{A_{i}} - 1 + {\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\; b_{k,i,l}}}}} \right)$ ${\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{({A_{i}{({r_{A_{i}} + {\frac{1}{\alpha_{i}}{({{N{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{k = 1}^{K}\;{({\sum\limits_{l = 1}^{L_{k}}\;{{\mathbb{e}}^{{- \alpha_{i}}d_{k,l}}{\sum\limits_{i^{\prime} = 1}^{I}\; b_{k,i^{\prime},l}}}})}}}})}}})}})}}}$ (which is a product of Gamma distributions);

P(B|A,α,D) is a product of multinomials, with P(b_(k)|A,α,D) having toss probabilities

             Equation  27 ${EMBED}\frac{w_{k,l}A_{i}{\mathbb{e}}^{{- \alpha_{i}}d_{k,l}}{\mathbb{e}}^{\sum\limits_{i^{\prime} = 1}^{I}\;{({\frac{A_{i^{\prime}}}{\alpha_{i^{\prime}}}{({1 - {\mathbb{e}}^{{- \alpha_{i^{\prime}}}\delta}})}{\sum\limits_{k = 1}^{K}\;{\mathbb{e}}^{{- \alpha_{i^{\prime}}}d_{k,l}}}})}}}{\sum\limits_{i = 1}^{i}\;{\sum\limits_{l = 1}^{L_{k}}\;{w_{k,l}A_{i}{\mathbb{e}}^{{- \alpha_{i}}d_{k,l}}{\mathbb{e}}^{\sum\limits_{i^{\prime} = 1}^{I}\;{({\frac{A_{i^{\prime}}}{\alpha_{i^{\prime}}}{({1 - {\mathbb{e}}^{{- \alpha_{i^{\prime}}}\delta}})}{\sum\limits_{k = 1}^{K}\;{\mathbb{e}}^{{- \alpha_{i^{\prime}}}d_{k,l}}}})}}}}}$ and total tosses

${\sum\limits_{n = 1}^{N}\; c_{n,k}};$ while finally

$\begin{matrix} \begin{matrix} {{P\left( {A,\left. \alpha \middle| B \right.,D} \right)} \propto \left( {\prod\limits_{i = 1}^{I}\;{A_{i}^{m_{A_{i}} - 1 + {\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\; b_{k,i,l}}}}\alpha_{i}^{m_{\alpha_{i}} - 1}}} \right)} \\ {{\mathbb{e}}^{- {\sum\limits_{i = 1}^{I}\;{({{r_{A_{i}}A_{i}} + {\alpha_{i}{({r_{\alpha_{i}} + {\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\;{b_{k,i,l}d_{k,l}}}}})}} + {\frac{A_{i}}{\alpha_{i}}{({{N{({{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}})}} - {{({1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}})}{\sum\limits_{k = 1}^{K}\;{({\sum\limits_{l = 1}^{L_{k}}\;{{\mathbb{e}}^{{- \alpha_{i}}d_{k,l}}{\sum\limits_{i^{\prime} = 1}^{I}\; b_{k,i^{\prime},l}}}})}}}})}}})}}}} \\ {\therefore{{P\left( {\left. \alpha \middle| B \right.,D} \right)} \propto {\int{{P\left( {A,\left. \alpha \middle| B \right.,D} \right)}{\mathbb{d}A}}}}} \\ {= {\prod\limits_{i = 1}^{I}\;\frac{\alpha_{i}^{m_{\alpha_{i}} - 1}{\mathbb{e}}^{- {\alpha_{i}{({r_{\alpha_{i}} + {\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\;{b_{k,i,l}d_{k,l}}}}})}}}{\Gamma\left( {m_{A_{i}} + {\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\; b_{k,i,l}}}} \right)}}{\left( {r_{A_{i}} + {\frac{1}{\alpha_{i}}\left( {{N\left( {{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}} \right)} - {\left( {1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}} \right){\sum\limits_{k = 1}^{K}\;\left( {\sum\limits_{l = 1}^{L_{k}}\;{{\mathbb{e}}^{{- \alpha_{i}}d_{k,l}}{\sum\limits_{i^{\prime} = 1}^{I}\; b_{k,i^{\prime},l}}}} \right)}}} \right)}} \right)^{m_{A_{i}} + {\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\; b_{k,i,l}}}}}}} \end{matrix} & {{Equation}\mspace{14mu} 28} \end{matrix}$ where of course the Gamma functions do need to be calculated as they are not constants.

Given these three conditional distributions, we can now in principle resample as follows. For odd j we now draw a sample for B_(j+1) from a multinomial distribution with the multi-way toss probabilities defined above, while for even j we resample (A_(j+i), α_(j+1)) (α is a vector) by first sampling a from the marginal conditional P(α_(j+1), |B_(j+1), D), and then sampling A_(j+1) from the conditional distribution P(A_(j+1)|α_(j+1),B_(j+1),D).

The only part of the this procedure that has so far not been fully defined is the step of resampling from P(α_(j+1)|B_(j+1),D). This will be expanded below.

With the above reasoning and derivation, algorithm A7 can be modified accordingly and is described below and with references to the flowcharts of FIG. 3. The modifications of importance occur in the substeps of the Bayesian inference analysis, substeps 910: 1-4 corresponding to substeps 810: 1-4 of algorithm A4, only. Therefore only these substeps are described below.

Algorithm A8:

-   -   910: The Bayesian inference analysis, step 910 (corresponding         to 810) comprises the substeps of:     -   910: 1 Initialize:     -   910: 1.1 set bin size and position: d_(k) (k=1, 2, . . . , K)         (from hardware design)     -   910: 1.2 set subbin size and position for each k: d_(k,l) (l=1,         2, . . . , L_(k)) (inside d_(k)'s bin)     -   910: 1.3 count photons in each time bin:

$c_{k} = {\sum\limits_{n = 1}^{N}\; c_{n,k}}$

-   -   910: 1.4 set number of samples required     -   910: 1.5 set both r_(A) _(i) , m_(A) _(i) and r_(α) _(i) ,m_(α)         _(i) in one of the same ways that r_(A) _(i) ,m_(A) _(i) were         set in algorithm A4.     -   910: 2: For each j:     -   910: 2.1 If j is odd: Update B.     -   910: 2.1.1 For each k(1, 2, . . . , K)     -   910: 2.1.1.1 Update b_(k):         -   set b_(k) to be a random sample from the multinomial             distribution with

$c_{k} = {\sum\limits_{n = 1}^{N}\; c_{n,k}}$ total tosses, IL_(k) outcomes and toss probabilities

${EMBED}\frac{w_{k,l}A_{i}{\mathbb{e}}^{{- \alpha_{i}}d_{k,l}}{\mathbb{e}}^{\sum\limits_{i^{\prime} = 1}^{I}\;{({\frac{A_{i^{\prime}}}{\alpha_{i^{\prime}}}{({1 - {\mathbb{e}}^{{- \alpha_{i^{\prime}}}\delta}})}{\sum\limits_{k = 1}^{K}\;{\mathbb{e}}^{{- a_{i^{\prime}}}d_{k,l}}}})}}}{\sum\limits_{i = 1}^{I}\;{\sum\limits_{l = 1}^{L_{k}}\;{w_{k,l}A_{i}{\mathbb{e}}^{{- \alpha_{i}}d_{k,l}}{\mathbb{e}}^{\sum\limits_{i^{\prime} = 1}^{I}\;{({\frac{A_{i^{\prime}}}{\alpha_{i^{\prime}}}{({1 - {\mathbb{e}}^{{- \alpha_{i^{\prime}}}\delta}})}{\sum\limits_{k = 1}^{K}\;{\mathbb{e}}^{{- \alpha_{i^{\prime}}}d_{k,l}}}})}}}}}$ (see  Appendix)

-   -   910: 2.1.2 Next k     -   910: 2.2 If j is even:     -   910: 2.2.1 Resample (A_(j+1), α_(j+1)) by     -   910: 2.2.1.1 Sampling a from P(α_(j+1)|B_(j+1),D) (eq. 28) (see         below for description of how this is done)     -   910: 2.2.1.2 Sampling A_(j+1), from P(A_(j+1)|α_(j+1),B_(j+1),D)         (eq.26)     -   910: 2.2.2 Add A to list of samples of A     -   910: 3 next j:     -   910: 4 Enough samples? Yes—goto 920, No—repeat 910: 2-4

Sampling α from P(α_(j+1)|B_(j+1),D) (in step 935) is not obvious. Below a suitable method, readily converted into program code, is outlined.

Resampling from the conditional for a can be performed as follows: We introduce a Markov Chain Monte Carlo (MCMC) technique whose proposal distribution is not a conditional distribution, does depend on the previous sample and does not always accept the new sample.

Suppose then that we have values of B_(j+1), and D, and also the previous value of the ith component of α namely α_(j,i) (we now have two subscripts in order to indicate both which sample and which component). Note that the conditional distribution of P(α|B,D) is separable over i, so that we can treat each component separately. Let the current conditional distribution P(α_(i)|B,D) be denoted f(α_(i)), so that

$\begin{matrix} {{f\left( \alpha_{i} \right)} \propto \frac{\alpha_{i}^{m_{\alpha_{i}} - 1}{\mathbb{e}}^{- {\alpha_{i}{({r_{\alpha_{i}} + {\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\;{b_{k,i,l}d_{k,l}}}}})}}}{\Gamma\left( {m_{A_{i}} + {\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\; b_{k,i,l}}}} \right)}}{\left( {r_{A_{i}} + {\frac{1}{\alpha_{i}}\left( {{N\left( {{\mathbb{e}}^{{- \alpha_{i}}\tau} - {\mathbb{e}}^{{- \alpha_{i}}v}} \right)} - {\left( {1 - {\mathbb{e}}^{{- \alpha_{i}}\delta}} \right){\sum\limits_{k = 1}^{K}\;\left( {\sum\limits_{l = 1}^{L_{k}}\;{{\mathbb{e}}^{{- \alpha_{i}}d_{k,l}}{\sum\limits_{i^{\prime} = 1}^{I}\; b_{b,i^{\prime},l}}}} \right)}}} \right)}} \right)^{m_{A_{i}} + {\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 1}^{L_{k}}\; b_{k,i,l}}}}}} & {{Equation}\mspace{14mu} 29} \end{matrix}$

Then the overall move in ai needs to satisfy detailed balance with respect to this distribution. It is easy to show that if it does, then the alternating sequence of moves described before will also hold detailed balance over every subsequence of three moves, and hence that the necessary conditions for our MCMC process will be met.

It is also easy to show that if we have two potential types of move that each holds detailed balance with respect to this distribution, then so also will a compound move that proceeds by choosing one of these two types at random (with any fixed probabilities) and applying it. We now then go on to describe two types of move, which we will use with some fixed probabilities (for example 0.5 and 0.5) whenever a move to resample α_(i) is required.

Both types of move involve sampling a proposed value α′ from a proposal distribution g(α′|α_(j,i)), dependent on the previous value of α_(i), namely α_(j,i), followed by a probabilistic decision either to accept α′ (in which case we set a_(j+1,i)=α′) or to reject it (in which case we set α_(j+1,i)=α_(j,i)). In both cases we accept with probability

$\begin{matrix} {p_{\alpha} = {\frac{{f\left( \alpha^{\prime} \right)}{g\left( \alpha_{j,i} \middle| \alpha^{\prime} \right)}}{{f\left( \alpha_{j,i} \right)}{g\left( \alpha^{\prime} \middle| \alpha_{j,i} \right)}}.}} & {{Equation}\mspace{14mu} 30} \end{matrix}$

All that remains then is to define the two proposal distributions, one for each type of move.

Proposal Distribution 1—“The Coarse Grid”:

Let α_(j,i) be given; fix also (once and for all) some parameters γ and H, where γ is a positive real number (20 will do) and H is a positive integer (again, 20 will do). Then let X₁ be the set

$\left\{ {x_{h} = {\alpha_{j,i}{\gamma^{\frac{h}{H}}:{h\;\varepsilon\left\{ {{- H},{{- H} + 1},\ldots,{H - 1},H} \right\}}}}} \right\},$ and let g₁(α′|α_(j,i)) be the unique (discrete) probability distribution on X₁ that is proportional to f(x). Proposal Distribution 2—“The Fine Fill-In”:

Using the same parameters γ and H, let X₂ be the closed interval

$\left\lbrack {{\alpha_{j,i}\gamma^{- \frac{1}{H}}},{\alpha_{j,i}\gamma^{+ \frac{1}{H}}}} \right\rbrack,$ and let g₂ (α′|α_(j,i)) be the unique (continuous) probability distribution on X₂ that is proportional to

$\frac{1}{x}.$

The measurement system with the capability of detecting and recording multiple photons after one excitation in combination with the method of the present invention, the essence of which is implementing Bayesian inference in the algorithms executed during each measurement, represents a significant improvement in measurement speed over the prior art techniques. The inventive method of, in each measurement, inferring the source (i.e. the originating fluorophore) of each photon, further shortens the measurement time (algorithm A3). In Table 1 a comparison is given of the measurement times of four different dyes (having different lifetimes) using the TCSPC and the TCMPC techniques. The same solutions were used with both instruments. These numbers are only indicative, but show a faster speed for the TCMPC technique.

TABLE 1 Measurement time with different dyes using TCSPC and TCMPC, respectively. Time to run the experiment(s) Lifetime of the Dye TCSPC TCMPC  4 ns 493 9.94  8 ns  28 9.55 14 ns 196 18.79 20 ns 640 13.35

In the described method according to the present invention, the fluorescence decay of a fluorophore bound to a biological molecule has been modelled by a mono-exponential decay or in some cases a bi-exponential decay. However, there are situations in which one does not expect a limited number of discrete decay times but rather a distribution of decay times. In complex heterogeneous biological systems, multi-exponential decays functions can appear to provide a better fit of the fluorescence decay data than the assumption of a mono-exponential decay. But the assumption of multiple discrete components is essentially arbitrary and is often erroneous. For example, for a single tryptophan protein, the distribution of decay time may reflect the distribution of protein conformation, alternatively it could be a protein with many tryptophan residues, so it is not practical to consider the individual decay times. Moreover, interaction between the fluorophore and the environment can result in complex fluorescence decay profiles that represent a continuous distribution of lifetimes. A method according to the present invention may also account for such cases.

The intensity decays λ(t) may be analysed in terms of a lifetime distribution ρ(τ_(l), wherein τ_(l)/1α and α is the decay constant. The total decay law becomes:

$\begin{matrix} {{\lambda(t)} = {\int_{\tau = 0}^{\infty}{{\rho\left( \tau_{1} \right)}{{\mathbb{e}}^{\frac{t}{\tau_{l}}} \cdot \ {\mathbb{d}\tau_{l}}}}}} & {{equation}\mspace{14mu} 31} \end{matrix}$

The fluorescence decay of biological systems may in some cases advantageously be described by a so-called stretched exponential as the stretched exponential reflects a continuous distribution of fluorescence lifetimes. The stretched exponential is introduced by:

$\begin{matrix} {{\lambda(t)} = {A_{0} \cdot {\mathbb{e}}^{- {(\frac{t}{\tau_{1}})}^{\frac{1}{h}}}}} & {{equation}\mspace{14mu} 32} \end{matrix}$ where h is called the heterogeneity and is related to the distribution of decay times. In the case of a mixture of both substrate and product, each contributing to the fluorescence decay, a sum of two stretched exponentials may be used:

$\begin{matrix} {{\lambda(t)} = {{A_{1} \cdot {\mathbb{e}}^{- {(\frac{t}{\tau_{l_{1}}})}^{\frac{1}{h_{1}}}}} + {A_{2} \cdot {\mathbb{e}}^{- {(\frac{t}{\tau_{l_{2}}})}^{\frac{1}{h_{2}}}}}}} & {{equation}\mspace{14mu} 33} \end{matrix}$

The stretched exponential model may advantageously be combined with the analysis using Bayesian inference according to the present invention which has been exemplified in the algorithms A1-A8. For example algorithm A1, taking into account the various deadtimes and utilizing the stretched exponential model may be modified as described below.

The Poisson arrival rate of the photons at time t is denoted by λ(t) as described by equation 32. The equations of algorithm A1 (equation 11-13) should be modified accordingly by using the following expression for the likelihood of observing the data D_(n):

$\begin{matrix} {{P\left( {\left. D_{n} \middle| A_{0} \right.,\tau,h} \right)} = {\left( {\prod\limits_{k = 1}^{K_{n}}\;\left( {\lambda\left( t_{n,k} \right)} \right)} \right){\mathbb{e}}^{- {({{\int_{\tau}^{v}{{\lambda{(t_{n,k})}}\ {\mathbb{d}t}}} - {\sum\limits_{k = 1}^{K_{n}}\;{\int_{t_{n,k}}^{t_{n,k} + \delta}{{\lambda{(t_{n,k})}}\ {\mathbb{d}t}}}}})}}}} & {{equation}\mspace{14mu} 34} \end{matrix}$ where the detector is dead for a duration δ after each photon is received, for a duration τ after the excitation, and at all times longer than υ after excitation. K_(n) is the number of photons received following the n^(th) laser pulse and t_(n,k) is the arrival of the k^(th) photon from laser pulse n. Furthermore, the expression for prior probability distribution should be modified accordingly to included any prior knowledge on the values of the heterogeneity parameter h. Also the other algorithms, including the algorithms using binning of photon arrival times (A4-A8), may in the same way be modified to include stretched exponentials.

The inventive method, exemplified with algorithms A1-A8, has been described here in combination with the measurement system comprising the photodetector 160 and the photon timing unit 150 having the ability to detect and output multiple photon arrival times after each excitation light pulse from the pulsed laser 120. This is considered to be the best mode of operation. However, as appreciated by those skilled in the art, parts of the method of the present invention can advantageously be used also with prior art apparatuses such as the TCSPC and Multiplexed-TCSPC, providing only one (TCSPC) or a limited (Multiplexed-TCSPC) number of photons per excitation pulse.

The inventive method and measurement system has been exemplified here with fluorophores. As appreciated by those skilled in the art the system and methods are equally applicable in characterising other luminescent substances e.g. phosphorescent materials.

Example of luminescent substances that can advantageously be analysed with the described method and system comprises fluorescent materials (which usually have short lifetimes, typically of the order of <1 ns-100 ns) e.g. Fluorescein, CyDyes, and ethidium bromides; and Phosphorescent material (which usually have longer lifetimes (typically a few ms)) e.g. ruthenium chelates, terbium chelates.

From the invention thus described, it will be obvious that the invention may be varied in many ways. Such variations are not to be regarded as a departure from the scope of the invention, and all such modifications as would be obvious to one skilled in the art are intended for inclusion within the scope of the following claims.

APPENDIX

A method of drawing random samples from a Gamma distribution and from a multinomial distribution, respectively, will be given below. The description will be in the form of guidelines which the skilled programmer can easily convert into subroutines suitable to call from algorithms A3-A8.

Random Samples from a Gamma Distribution

The Gamma distribution is defined by

${\Gamma_{m,r}(x)} = \frac{r^{m}x^{m - 1}{\mathbb{e}}^{- {rx}}}{\Gamma(m)}$ as described above. Obtaining a random sample from it can be done in many ways. The best known currently to the inventors proceeds differently depending on whether m is less than 1, equal to 1, or greater than 1. Whichever is being used, we can initially assume that r=1 and then divide the resulting sample by r afterwards. The Easy Case: m=1

In this case the distribution reduces to an exponential distribution. The cumulative distribution function is therefore P(x<y)=1−e ^(−y) and we may therefore choose a uniformly distributed random number u from the interval [0, 1] and solve the equation u=1−e^(−y) for y which we output as our random sample. The Difficult Cases: m<1 and m>1

For both of these cases we use forms of rejection sampling.

Suppose we want to sample from a probability distribution f(x) and are already able to sample from a probability distribution g(x). Suppose moreover that there exists a constant K such that for all x we have Kf (x)≦g(x). Then it is easy to see that the following algorithm will result in a sample from f(x) with probability K and with the remaining probability will result in no sample:

-   -   Draw a random sample y from g(x).     -   With probability Kf(x)/g(x) let y be the resultant sample, and         with the remaining probability let there be no resultant sample.

If, therefore, we keep applying this algorithm until it does yield a sample, then we will end up with a sample from f(x) with probability 1−(1−K)^(N) after N repeats. Since this probability approaches 1 as N approaches infinity, we will eventually end up with a sample with probability 1.

All that remains now is to specify g(x) for each of the relevant cases, state how to draw samples from g(x), and how to calculate Kf (x)/g(x).

m>1

g(x) is given by

${g(x)} = {{\frac{c}{2\left( {c + \left( {x - b} \right)^{2}} \right)^{3/2}}{where}\mspace{14mu} b} = {{m - {1\mspace{14mu}{and}\mspace{14mu} c}} = {{3b} + {\frac{9}{4}.}}}}$ The cumulative density function is given by

${P_{g}\left( {x < y} \right)} = {\frac{1}{2}\left( {1 \pm \sqrt{1 - \frac{c}{c + \left( {y - b} \right)^{2}}}} \right)}$ where the positive sign is taken if y>b and the negative sign otherwise. We can therefore draw randomly from g(x) by drawing u randomly from the interval [0, 1], solving

${u = {\frac{1}{2}\left( {1 \pm \sqrt{1 - \frac{c}{c + \left( {y - b} \right)^{2}}}} \right)\mspace{14mu}{for}\mspace{14mu} y}},$ and making y be our random sample from g(x).

Now, let

${{h(x)} = \frac{g(x)}{f(x)}},$ so that

$\begin{matrix} {{h(x)} = \frac{\frac{c}{2\left( {c + \left( {x - b} \right)^{2}} \right)^{3/2}}}{\frac{x^{m - 1}{\mathbb{e}}^{- x}}{\Gamma(m)}}} \\ {= \frac{c\;{\Gamma(m)}{\mathbb{e}}^{x}}{2{x^{m - 1}\left( {c + \left( {x - b} \right)^{2}} \right)}^{3/2}}} \end{matrix}$ and this is therefore minimised where

$0 = {{h^{\prime}(x)} = {\frac{c\;{\Gamma(m)}{\mathbb{e}}^{x}}{2{x^{m - 1}\left( {c + \left( {x - b} \right)^{2}} \right)}^{3/2}}\left( {1 - \frac{m - 1}{x} - \frac{3\left( {x - b} \right)}{c + \left( {x - b} \right)^{2}}} \right)}}$ which is where the final factor is zero, or

$0 = {{{1 - \frac{m - 1}{x} - \frac{3\left( {x - b} \right)}{c + \left( {x - b} \right)^{2}}}\therefore{{x\left( {c + \left( {x - b} \right)^{2}} \right)} - {\left( {m - 1} \right)\left( {c + \left( {x - b} \right)^{2}} \right)} - {3\left( {x - b} \right)^{2}}}} = {{0\therefore{{\left( {x - b} \right)\left( {c + \left( {x - b} \right)^{2}} \right)} - {3\left( {x - b} \right)^{2}}}} = {{0\therefore{\left( {x - b} \right)\left( {c + \left( {x - b} \right)^{2} - {3\left( {x - b} \right)}} \right)}} = {{0\therefore{\left( {x - b} \right)\left( {\left( {x - b} \right)^{2} - {3\left( {x - b} \right)} + \left( {{3b} + \frac{9}{4}} \right)} \right)}} = 0}}}}$

The second factor has a negative discriminant since b>0, and can therefore never be zero and is always positive; the only extremum of h(x) is therefore at x=b and is a minimum; at that point we have

${K = {{\min\limits_{x}\mspace{14mu}{h(x)}} = {{h(b)} = {\frac{c\;{\Gamma(m)}{\mathbb{e}}^{b}}{2{b^{m - 1}\left( {c + \left( {b - b} \right)^{2}} \right)}^{3/2}} = \frac{{\Gamma(m)}{\mathbb{e}}^{b}}{2b^{b}c^{1/2}}}}}},$ so the acceptance probability for the sample can be set at

$\begin{matrix} {{p_{a}(x)} = {K\;{{f(x)}/{g(x)}}}} \\ {= {\frac{{\Gamma(m)}{\mathbb{e}}^{b}}{2b^{b}c^{1/2}}\frac{2{x^{m - 1}\left( {c + \left( {x - b} \right)^{2}} \right)}^{3/2}}{c\;{\Gamma(m)}e^{x}}}} \\ {= {\frac{{\mathbb{e}}^{b}}{b^{b}c^{3/2}}{x^{b}\left( {c + \left( {x - b} \right)^{2}} \right)}^{3/2}{\mathbb{e}}^{- x}}} \end{matrix}$

Finally, we note that we will implement the acceptance decision by drawing a uniformly distributed random number ν from the interval [0, 1], and accepting our random sample if ν<P_(α)(x). The test for whether ν<p_(α)(x) or not can be speeded up in many instances by testing first whether ν is less than some other function of x that is simpler to calculate and which is always less than p_(α)(x), and accepting the sample if it is.

m<1

In this case we set

${g(x)} = \left\{ \begin{matrix} \frac{{mx}^{m - 1}t}{t^{m}\left( {t + m^{- t}} \right)} & {{{if}\mspace{14mu} 0} \leqq x \leqq t} \\ \frac{m\;{\mathbb{e}}^{- x}}{t + {m\;{\mathbb{e}}^{- t}}} & {{{if}\mspace{14mu} x} > t} \\ 0 & {otherwise} \end{matrix} \right.$ where t=1−m.

The cumulative density function is

${P_{g}\left( {x < y} \right)} = \left\{ \begin{matrix} \frac{y^{m}t}{t^{m}\left( {t + {m\;{\mathbb{e}}^{- t}}} \right)} & {{{if}\mspace{14mu} 0} \leq y \leq t} \\ {1 - \frac{m\;{\mathbb{e}}^{- y}}{t + {m\;{\mathbb{e}}^{- t}}}} & {{{if}\mspace{14mu} y} > t} \\ 0 & {otherwise} \end{matrix} \right.$ and we can therefore draw a random sample from g(x) by drawing a uniformly distributed random number u from the interval [0, 1] and solving P_(g)(x<y)=u for y.

Similarly to the derivation in the previous section, we can now set

${h(x)} = {\frac{g(x)}{f(x)} = \left\{ \begin{matrix} \frac{{mt}\;{\Gamma(m)}{\mathbb{e}}^{x}}{t^{m}\left( {t + {m\;{\mathbb{e}}^{- t}}} \right)} & {{{if}\mspace{14mu} 0} \leq x \leq t} \\ \frac{m\;{\Gamma(m)}x^{t}}{t + {m\;{\mathbb{e}}^{- t}}} & {{{if}\mspace{14mu} x} > t} \end{matrix} \right.}$

The minima of both continuous sections are at the left hand end of the section, i.e.

${\underset{x \in I}{\arg\mspace{14mu}\min}\mspace{14mu}{g(x)}} = \left\{ \begin{matrix} 0 & {{{if}\mspace{14mu} I} = \left\lbrack {0,t} \right\rbrack} \\ {t +} & {{{if}\mspace{14mu} I} = \left( {x,t} \right\rbrack} \end{matrix} \right.$ and are therefore at

$K = \frac{{\Gamma(m)}{mt}}{t^{m}\left( {t + {m\;{\mathbb{e}}^{- t}}} \right)}$ in both cases.

Therefore the acceptance probability

${{p_{a}(x)}\mspace{14mu}{is}\mspace{14mu}{\mathbb{e}}^{- y}\mspace{14mu}{if}\mspace{14mu} y} \leq {t\mspace{14mu}{or}\mspace{14mu}\left( \frac{y}{t} \right)^{m - 1}\mspace{14mu}{if}\mspace{14mu} y} > {t.}$

Finally, we note that we will implement the acceptance decision by drawing a uniformly distributed random number ν from the interval [0, 1], and accepting our random sample if ν<p_(α)(x). The test for whether ν<p_(α)(x) or not can be rearranged by first calculating

$w = \left\{ \begin{matrix} x & {{{if}\mspace{14mu} x} \leq t} \\ {t\mspace{14mu}{\log\left( \frac{x}{t} \right)}} & {{{if}\mspace{14mu} x} > t} \end{matrix} \right.$ then testing whether ν<e^(−w). This test can then be speeded up in many instances by first testing whether

$v > \frac{1}{1 + w}$ (in which case we reject the sample and try all over again), or whether ν<1−w (in which case we accept the sample and have finished), and only if we reach this point do we then have to test whether ν<e^(−w). Random Samples from a Multinomial Distribution

We finally turn to efficient methods for sampling from a multinomial distribution.

The multinomial distribution is analagous to the binomial distribution, but for tosses where there are more than 2 possible outcomes. The parameters are N, the total number of tosses, and p, the vector of probabilities for the different possible results of a toss. The distribution is given by

${P\left( {{n❘N},p} \right)} = {\frac{N!}{\prod\limits_{i = 1}^{I}\;{n_{i}!}}{\prod\limits_{i = 1}^{I}\;{p_{i}^{n_{i}}.}}}$ Converting Production of a Single Multinomial Random Sample Into a Sequence of Binomial Ones

The best way known to the author for sampling from this distribution is to convert the problem into a sequence of binomial random samples. The first determines the values of n₁ and

${\sum\limits_{i = 2}^{I}n_{i}},$ using as parameters for the binomial draw N and p₁. The kth determines the values of n_(k) and

${\sum\limits_{i = {k + 1}}^{I}n_{i}},$ using as parameters for the binomial draw

$N - {\sum\limits_{i = 1}^{k - 1}n_{i}}$ and p_(k). That leaves the question of how to efficiently produce a binomial random sample. Production of Binomial Random Samples

The binomial distribution is the special case of the multinomial distribution where I=2, except that usually (including here) the 2-element parameter vector p is presented as the single element p=p₁ (which uniquely determines p since the elements of the latter must sum to 1).

The best way known to the inventors for sampling from the binomial distribution is to first order the values of

$q_{n} = {\frac{N!}{\left( {N - n} \right)!}{p^{n}\left( {1 - p} \right)}^{N - n}}$ in descending order (conceptually, without actually calculating them all), then to draw a uniformly distributed random number x from the range [0, 1], then to subtract from x in succession the values of q_(n) in succession starting with the largest. The output value n is the index of the q_(n) which takes the remaining amount left in x below zero.

Implementation of this can take advantage of the fact that the method works almost as well if the q_(n) are used in a slightly different order from the optimal one. We can therefore safely assume that

${{\underset{n}{\arg\mspace{14mu}\max}\left( q_{n} \right)} = {{round}({Np})}},$ and calculate this q_(n) first. Each subsequent one can then be calculated in order from either the one before or the one after it in succession. 

What is claimed is:
 1. A method for determining one or more characteristics of a fluorophore material, the method comprising the steps of: a) irradiating the fluorophore material with a pulse of excitation light from a single light source; b) providing a triggering signal correlated to the pulse of excitation light; c) detecting with a single photomultiplier tube (PMT), a plurality of photons emitted from the fluorophore material as result of the pulse of excitation light, the single PMT providing an output signal that represents the plurality of photons detected by the single PMT; d) determining for each detected photon a photon, in the plurality of photons detected by the single PMT, arrival time and providing an output suitable for inputting to an analysing module wherein an output comprises zero, one, or more photon arrival times for each excitation; e) repeating steps a) to d) until a predetermined number of excitations has been performed; f) receiving said outputs in an analysing module; g) determining, in the analysing module, characteristic properties of the fluorophore material by performing a probabilistic analysis based on Bayesian inference that does not provide spatial resolution; and wherein performing the probabilistic analysis based on Bayesian inference comprises taking into account a first time period (δ) describing a photomultiplier tube (PMT) dead time; a second time period (τ) describing blocking of the photodetector after an excitation; and a third time period (υ) describing the duration of recording after each excitation; and h) providing an output of the probabilistic analysis based on the Bayesian inference to a computer.
 2. The method of claim 1, wherein the fluorophore material is selected based on a fluorescence lifetime of the fluorophore material, an initial intensity of the fluorophore material, and ratios of fluorescence initial intensities.
 3. The method of claim 1, wherein performing probabilistic analysis based on the Bayesian inference comprises determining the fluorophore material from which each detected photon originates.
 4. The method of claim 1, wherein performing probabilistic analysis based on the Bayesian inference comprises including experimental artefacts in the Bayesian inference.
 5. The method of claim 1, wherein steps a) to g) are repeated until statistical uncertainties of the measured properties are below predefined values or until a predetermined number of repetitions of steps a) to g) have been performed.
 6. The method of claim 1, wherein performing probabilistic analysis based on the Bayesian inference further comprises also inferring in which part of a time bin the true arrival time of each photon lies.
 7. A measurement system for measuring luminescence characteristic properties of a fluorophore material, comprising a light source driving and controlling unit; and an excitation light source for irradiating the fluorophore material with pulses of excitation light, said light source driving and controlling unit providing a triggering signal correlated to each pulse of excitation light; a single photomultiplier tube (PMT), for detecting a plurality of photons emitted from the fluorophore material as result of a single pulse of excitation light, said single PMT providing an amplified output signal that represents the plurality of photons detected by the single PMT; means for photon timing determination coupled to receive said amplified output signal and said triggering signal, the means for photon timing determination determining for each emitted photon in the plurality of photons detected by the single PMT, a photon arrival time and providing an output of a plurality of photon arrival times, and means for analysing the plurality of photon arrival times, arranged to receive said plurality of photon arrival times outputted from said means from photon timing determination, and able to determine from the plurality of photon arrival times characteristic properties for the fluorophore material, wherein the photon timing determination means determines and stores a plurality of arrival time measures corresponding to a plurality of detected photons, the plurality of photons resulting from the same pulse of excitation light; and wherein said means for analysing the plurality of photon arrival times, utilises an algorithm for the determination of characteristic fluorescent properties of the fluorophore material that is based on Bayesian inference; and wherein the algorithm for the determination of characteristic luminescent properties of the fluorophore material based on the Bayesian inference includes a first time period (δ) describing a PMT dead time; a second time period (τ) describing blocking of the photodetector after an excitation; and a third time period (υ) describing the duration of recording after each excitation.
 8. The measurement system of claim 7, wherein said means for analysing the plurality of photon arrival times is capable of performing probabilistic analysis based on the Bayesian inference and inferring in which a time bin the true arrival time of each photon lies.
 9. The measurement system of claim 7, wherein said photon timing determination means is arranged to record a signal from a pre-amplifier at a sampling frequency above 1 GHz.
 10. The method of claim 1 wherein detecting with a single photodetector further comprises detecting with a single photodetector forming a portion of a photodector array, a plurality of photons emitted from the fluorophore material as result of the pulse of excitation light, the photodector array including a plurality of photodectors, each photodetector detecting a plurality of photons emitted from the fluorophore material as result of the pulse of excitation light.
 11. The method of claim 1 wherein detecting with a single photodetector further comprises detecting with a photon counting photomultiplier tube (PMT) a plurality of photons emitted from the fluorophore material as result of the pulse of excitation light. 